TSTP Solution File: KRS043+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS043+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 03:00:24 EDT 2022
% Result : Satisfiable 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS043+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.33 % Computer : n022.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 7 20:35:50 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.14/0.37 # and selection function SelectNewComplexAHP.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 59 Number of unprocessed: 59
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 59 beginning clauses after preprocessing and clausification
% 0.20/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.20/0.37 # No conjectures.
% 0.20/0.37 # There are 59 start rule candidates:
% 0.20/0.37 # Found 2 unit axioms.
% 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.37 # 59 start rule tableaux created.
% 0.20/0.37 # 57 extension rule candidate clauses
% 0.20/0.37 # 2 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.38 # 3854 Satisfiable branch
% 0.20/0.38 # Satisfiable branch found.
% 0.20/0.38 # There were 1 total branch saturation attempts.
% 0.20/0.38 # There were 0 of these attempts blocked.
% 0.20/0.38 # There were 0 deferred branch saturation attempts.
% 0.20/0.38 # There were 0 free duplicated saturations.
% 0.20/0.38 # There were 0 total successful branch saturations.
% 0.20/0.38 # There were 0 successful branch saturations in interreduction.
% 0.20/0.38 # There were 0 successful branch saturations on the branch.
% 0.20/0.38 # There were 0 successful branch saturations after the branch.
% 0.20/0.38 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.38 # Begin clausification derivation
% 0.20/0.38
% 0.20/0.38 # End clausification derivation
% 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.38 cnf(i_0_99, plain, (cSatisfiable(i2003_11_14_17_16_14536))).
% 0.20/0.38 cnf(i_0_40, plain, (~cowlNothing(X1))).
% 0.20/0.38 cnf(i_0_43, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.20/0.38 cnf(i_0_81, plain, (~ra_Px1(X1,X2)|~ca_Cx1xcomp(X1))).
% 0.20/0.38 cnf(i_0_59, plain, (~ra_Px7(X1,X2)|~cp4(X1))).
% 0.20/0.38 cnf(i_0_42, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.20/0.38 cnf(i_0_47, plain, (ca_Cx1(X1)|~cp1(X1))).
% 0.20/0.38 cnf(i_0_64, plain, (~ra_Px4(X1,X2)|~cp5(X1))).
% 0.20/0.38 cnf(i_0_83, plain, (~ra_Px2(X1,X2)|~ca_Cx2(X1))).
% 0.20/0.38 cnf(i_0_94, plain, (~ra_Px3(X1,X2)|~ca_Cx3(X1))).
% 0.20/0.38 cnf(i_0_52, plain, (~ra_Px5(X1,X2)|~cp2xcomp(X1))).
% 0.20/0.38 cnf(i_0_50, plain, (ca_Cx2(X1)|~cp2(X1))).
% 0.20/0.38 cnf(i_0_55, plain, (ca_Cx3(X1)|~cp3(X1))).
% 0.20/0.38 cnf(i_0_85, plain, (cp4xcomp(X1)|~ca_Cx2(X1))).
% 0.20/0.38 cnf(i_0_91, plain, (cp4xcomp(X1)|~ca_Cx3(X1))).
% 0.20/0.38 cnf(i_0_79, plain, (cp5xcomp(X1)|~ca_Cx1(X1))).
% 0.20/0.38 cnf(i_0_78, plain, (cp2xcomp(X1)|~ca_Cx1(X1))).
% 0.20/0.38 cnf(i_0_77, plain, (cp3xcomp(X1)|~ca_Cx1(X1))).
% 0.20/0.38 cnf(i_0_57, plain, (~ra_Px6(X1,X2)|~cp3xcomp(X1))).
% 0.20/0.38 cnf(i_0_87, plain, (cp5xcomp(X1)|~ca_Cx2(X1))).
% 0.20/0.38 cnf(i_0_92, plain, (cp5xcomp(X1)|~ca_Cx3(X1))).
% 0.20/0.38 cnf(i_0_60, plain, (cp5xcomp(X1)|~cp4(X1))).
% 0.20/0.38 cnf(i_0_86, plain, (cp3xcomp(X1)|~ca_Cx2(X1))).
% 0.20/0.38 cnf(i_0_76, plain, (cp4xcomp(X1)|~ca_Cx1(X1))).
% 0.20/0.38 cnf(i_0_45, plain, (ca_Ax14(esk1_1(X1))|~cSatisfiable(X1))).
% 0.20/0.38 cnf(i_0_73, plain, (ca_Cx1(X1)|~ra_Px1(X1,X2))).
% 0.20/0.38 cnf(i_0_61, plain, (cp4xcomp(X1)|~ra_Px7(X1,X2))).
% 0.20/0.38 cnf(i_0_71, plain, (cp1(esk10_1(X1))|~ca_Ax14(X1))).
% 0.20/0.38 cnf(i_0_88, plain, (ca_Cx2xcomp(X1)|~ra_Px2(X1,X2))).
% 0.20/0.38 cnf(i_0_65, plain, (cp5xcomp(X1)|~ra_Px4(X1,X2))).
% 0.20/0.38 cnf(i_0_95, plain, (ca_Cx3xcomp(X1)|~ra_Px3(X1,X2))).
% 0.20/0.38 cnf(i_0_48, plain, (cp2(X1)|~ra_Px5(X1,X2))).
% 0.20/0.38 cnf(i_0_53, plain, (cp3(X1)|~ra_Px6(X1,X2))).
% 0.20/0.38 cnf(i_0_80, plain, (ra_Px1(X1,esk14_1(X1))|ca_Cx1xcomp(X1))).
% 0.20/0.38 cnf(i_0_89, plain, (ra_Px2(X1,esk16_1(X1))|~ca_Cx2xcomp(X1))).
% 0.20/0.38 cnf(i_0_96, plain, (ra_Px3(X1,esk18_1(X1))|~ca_Cx3xcomp(X1))).
% 0.20/0.38 cnf(i_0_49, plain, (ra_Px5(X1,esk2_1(X1))|~cp2(X1))).
% 0.20/0.38 cnf(i_0_54, plain, (ra_Px6(X1,esk4_1(X1))|~cp3(X1))).
% 0.20/0.38 cnf(i_0_90, plain, (ca_Cx3(X1)|~cp5xcomp(X1)|~cp4xcomp(X1))).
% 0.20/0.38 cnf(i_0_58, plain, (ra_Px7(X1,esk6_1(X1))|cp4(X1))).
% 0.20/0.38 cnf(i_0_44, plain, (cSatisfiable(X1)|~rinvR(X1,X2)|~ca_Ax14(X2))).
% 0.20/0.38 cnf(i_0_98, plain, (rr(X1,X2)|~rinvR(X2,X1))).
% 0.20/0.38 cnf(i_0_84, plain, (ca_Cx2(X1)|~cp5xcomp(X1)|~cp4xcomp(X1)|~cp3xcomp(X1))).
% 0.20/0.38 cnf(i_0_72, plain, (rr(X1,esk10_1(X1))|~ca_Ax14(X1))).
% 0.20/0.38 cnf(i_0_63, plain, (ra_Px4(X1,esk8_1(X1))|cp5(X1))).
% 0.20/0.38 cnf(i_0_97, plain, (rinvR(X1,X2)|~rr(X2,X1))).
% 0.20/0.38 cnf(i_0_74, plain, (ra_Px1(X1,esk13_1(X1))|~ca_Cx1(X1))).
% 0.20/0.38 cnf(i_0_66, plain, (ra_Px4(X1,esk9_1(X1))|~cp5xcomp(X1))).
% 0.20/0.38 cnf(i_0_62, plain, (ra_Px7(X1,esk7_1(X1))|~cp4xcomp(X1))).
% 0.20/0.38 cnf(i_0_82, plain, (ra_Px2(X1,esk15_1(X1))|ca_Cx2(X1))).
% 0.20/0.38 cnf(i_0_93, plain, (ra_Px3(X1,esk17_1(X1))|ca_Cx3(X1))).
% 0.20/0.38 cnf(i_0_75, plain, (ca_Cx1(X1)|~cp5xcomp(X1)|~cp4xcomp(X1)|~cp3xcomp(X1)|~cp2xcomp(X1))).
% 0.20/0.38 cnf(i_0_67, plain, (ca_Ax14(X1)|esk12_1(X1)!=esk11_1(X1)|~rr(X1,X2)|~cp1(X2))).
% 0.20/0.38 cnf(i_0_46, plain, (rinvR(X1,esk1_1(X1))|~cSatisfiable(X1))).
% 0.20/0.38 cnf(i_0_70, plain, (X1=X2|~rr(X3,X2)|~rr(X3,X1)|~ca_Ax14(X3))).
% 0.20/0.38 cnf(i_0_51, plain, (ra_Px5(X1,esk3_1(X1))|cp2xcomp(X1))).
% 0.20/0.38 cnf(i_0_56, plain, (ra_Px6(X1,esk5_1(X1))|cp3xcomp(X1))).
% 0.20/0.38 cnf(i_0_69, plain, (rr(X1,esk11_1(X1))|ca_Ax14(X1)|~rr(X1,X2)|~cp1(X2))).
% 0.20/0.38 cnf(i_0_68, plain, (rr(X1,esk12_1(X1))|ca_Ax14(X1)|~rr(X1,X2)|~cp1(X2))).
% 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.38 # Begin printing tableau
% 0.20/0.38 # Found 3 steps
% 0.20/0.38 cnf(i_0_99, plain, (cSatisfiable(i2003_11_14_17_16_14536)), inference(start_rule)).
% 0.20/0.38 cnf(i_0_100, plain, (cSatisfiable(i2003_11_14_17_16_14536)), inference(extension_rule, [i_0_45])).
% 0.20/0.38 cnf(i_0_275, plain, (ca_Ax14(esk1_1(i2003_11_14_17_16_14536))), inference(extension_rule, [i_0_71])).
% 0.20/0.38 # End printing tableau
% 0.20/0.38 # SZS output end
% 0.20/0.38 # Branches closed with saturation will be marked with an "s"
% 0.20/0.38 # Child (3854) has found a proof.
% 0.20/0.38
% 0.20/0.38 # Proof search is over...
% 0.20/0.38 # Freeing feature tree
%------------------------------------------------------------------------------