%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS008-1 : TPTP v8.1.0. Released v2.0.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 : n023.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:19 EDT 2022 % Result : Satisfiable 0.18s 0.46s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : KRS008-1 : TPTP v8.1.0. Released v2.0.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n023.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 7 14:52:08 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y % 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 54 Number of unprocessed: 54 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 54 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 2 conjectures. % 0.12/0.36 # There are 2 start rule candidates: % 0.12/0.36 # Found 2 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 2 start rule tableaux created. % 0.12/0.36 # 52 extension rule candidate clauses % 0.12/0.36 # 2 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.36 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux. % 0.12/0.36 # We now have 26 tableaux to operate on % 0.18/0.46 # 19873 Satisfiable branch % 0.18/0.46 # Satisfiable branch found. % 0.18/0.46 # There were 1 total branch saturation attempts. % 0.18/0.46 # There were 0 of these attempts blocked. % 0.18/0.46 # There were 0 deferred branch saturation attempts. % 0.18/0.46 # There were 0 free duplicated saturations. % 0.18/0.46 # There were 0 total successful branch saturations. % 0.18/0.46 # There were 0 successful branch saturations in interreduction. % 0.18/0.46 # There were 0 successful branch saturations on the branch. % 0.18/0.46 # There were 0 successful branch saturations after the branch. % 0.18/0.46 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.46 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.46 # Begin clausification derivation % 0.18/0.46 % 0.18/0.46 # End clausification derivation % 0.18/0.46 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.46 cnf(i_0_55, negated_conjecture, (e(exist))). % 0.18/0.46 cnf(i_0_56, negated_conjecture, (~f(exist))). % 0.18/0.46 cnf(i_0_73, plain, (r2most(X1)|~e(X1))). % 0.18/0.46 cnf(i_0_58, plain, (c(X1)|~s2least(X1))). % 0.18/0.46 cnf(i_0_63, plain, (s1most(X1)|~d(X1))). % 0.18/0.46 cnf(i_0_57, plain, (s2least(X1)|~c(X1))). % 0.18/0.46 cnf(i_0_64, plain, (d(X1)|~s1most(X1))). % 0.18/0.46 cnf(i_0_59, plain, (~equalish(u1r2(X1),u1r1(X1))|~s2least(X1))). % 0.18/0.46 cnf(i_0_71, plain, (c(u4r1(X1))|~e(X1))). % 0.18/0.46 cnf(i_0_69, plain, (d(u4r2(X1))|~e(X1))). % 0.18/0.46 cnf(i_0_66, plain, (s1most(X1)|~equalish(u3r2(X1),u3r1(X1)))). % 0.18/0.46 cnf(i_0_70, plain, (r(X1,u4r2(X1))|~e(X1))). % 0.18/0.46 cnf(i_0_72, plain, (r(X1,u4r1(X1))|~e(X1))). % 0.18/0.46 cnf(i_0_76, plain, (r2most(X1)|~equalish(u5r2(X1),u5r1(X1)))). % 0.18/0.46 cnf(i_0_78, plain, (r2most(X1)|~equalish(u5r3(X1),u5r2(X1)))). % 0.18/0.46 cnf(i_0_77, plain, (r2most(X1)|~equalish(u5r3(X1),u5r1(X1)))). % 0.18/0.46 cnf(i_0_68, plain, (s1most(X1)|s(X1,u3r2(X1)))). % 0.18/0.46 cnf(i_0_67, plain, (s1most(X1)|s(X1,u3r1(X1)))). % 0.18/0.46 cnf(i_0_61, plain, (s(X1,u1r2(X1))|~s2least(X1))). % 0.18/0.46 cnf(i_0_60, plain, (s(X1,u1r1(X1))|~s2least(X1))). % 0.18/0.46 cnf(i_0_80, plain, (r2most(X1)|r(X1,u5r2(X1)))). % 0.18/0.46 cnf(i_0_79, plain, (r2most(X1)|r(X1,u5r1(X1)))). % 0.18/0.46 cnf(i_0_81, plain, (r2most(X1)|r(X1,u5r3(X1)))). % 0.18/0.46 cnf(i_0_96, plain, (d(u6r4(X1))|c(u6r2(X1))|f(X1))). % 0.18/0.46 cnf(i_0_95, plain, (d(u6r3(X1))|c(u6r2(X1))|f(X1))). % 0.18/0.46 cnf(i_0_91, plain, (d(u6r4(X1))|c(u6r1(X1))|f(X1))). % 0.18/0.46 cnf(i_0_90, plain, (d(u6r3(X1))|c(u6r1(X1))|f(X1))). % 0.18/0.46 cnf(i_0_98, plain, (r(X1,u6r4(X1))|c(u6r2(X1))|f(X1))). % 0.18/0.46 cnf(i_0_97, plain, (r(X1,u6r3(X1))|c(u6r2(X1))|f(X1))). % 0.18/0.46 cnf(i_0_84, plain, (f(X1)|~equalish(u6r2(X1),u6r1(X1))|~equalish(u6r4(X1),u6r3(X1)))). % 0.18/0.46 cnf(i_0_94, plain, (c(u6r2(X1))|f(X1)|~equalish(u6r4(X1),u6r3(X1)))). % 0.18/0.46 cnf(i_0_89, plain, (c(u6r1(X1))|f(X1)|~equalish(u6r4(X1),u6r3(X1)))). % 0.18/0.46 cnf(i_0_86, plain, (d(u6r4(X1))|f(X1)|~equalish(u6r2(X1),u6r1(X1)))). % 0.18/0.46 cnf(i_0_93, plain, (r(X1,u6r4(X1))|c(u6r1(X1))|f(X1))). % 0.18/0.46 cnf(i_0_85, plain, (d(u6r3(X1))|f(X1)|~equalish(u6r2(X1),u6r1(X1)))). % 0.18/0.46 cnf(i_0_104, plain, (r(X1,u6r2(X1))|f(X1)|~equalish(u6r4(X1),u6r3(X1)))). % 0.18/0.46 cnf(i_0_99, plain, (r(X1,u6r1(X1))|f(X1)|~equalish(u6r4(X1),u6r3(X1)))). % 0.18/0.46 cnf(i_0_88, plain, (r(X1,u6r4(X1))|f(X1)|~equalish(u6r2(X1),u6r1(X1)))). % 0.18/0.46 cnf(i_0_92, plain, (r(X1,u6r3(X1))|c(u6r1(X1))|f(X1))). % 0.18/0.46 cnf(i_0_106, plain, (r(X1,u6r2(X1))|d(u6r4(X1))|f(X1))). % 0.18/0.46 cnf(i_0_74, plain, (e(X1)|~r2most(X1)|~r(X1,X2)|~r(X1,X3)|~d(X2)|~c(X3))). % 0.18/0.46 cnf(i_0_65, plain, (equalish(X1,X2)|~s1most(X3)|~s(X3,X2)|~s(X3,X1))). % 0.18/0.46 cnf(i_0_87, plain, (r(X1,u6r3(X1))|f(X1)|~equalish(u6r2(X1),u6r1(X1)))). % 0.18/0.46 cnf(i_0_62, plain, (equalish(X1,X2)|s2least(X3)|~s(X3,X2)|~s(X3,X1))). % 0.18/0.46 cnf(i_0_101, plain, (r(X1,u6r1(X1))|d(u6r4(X1))|f(X1))). % 0.18/0.46 cnf(i_0_105, plain, (r(X1,u6r2(X1))|d(u6r3(X1))|f(X1))). % 0.18/0.46 cnf(i_0_100, plain, (r(X1,u6r1(X1))|d(u6r3(X1))|f(X1))). % 0.18/0.46 cnf(i_0_108, plain, (r(X1,u6r4(X1))|r(X1,u6r2(X1))|f(X1))). % 0.18/0.46 cnf(i_0_107, plain, (r(X1,u6r3(X1))|r(X1,u6r2(X1))|f(X1))). % 0.18/0.46 cnf(i_0_103, plain, (r(X1,u6r4(X1))|r(X1,u6r1(X1))|f(X1))). % 0.18/0.46 cnf(i_0_102, plain, (r(X1,u6r3(X1))|r(X1,u6r1(X1))|f(X1))). % 0.18/0.46 cnf(i_0_83, plain, (equalish(X1,X2)|~r(X3,X2)|~r(X3,X1)|~c(X2)|~c(X1)|~f(X3))). % 0.18/0.46 cnf(i_0_82, plain, (equalish(X1,X2)|~r(X3,X2)|~r(X3,X1)|~d(X2)|~d(X1)|~f(X3))). % 0.18/0.46 cnf(i_0_75, plain, (equalish(X1,X2)|equalish(X1,X3)|equalish(X2,X3)|~r2most(X4)|~r(X4,X3)|~r(X4,X2)|~r(X4,X1))). % 0.18/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.46 # Begin printing tableau % 0.18/0.46 # Found 4 steps % 0.18/0.46 cnf(i_0_56, negated_conjecture, (~f(exist)), inference(start_rule)). % 0.18/0.46 cnf(i_0_109, plain, (~f(exist)), inference(extension_rule, [i_0_101])). % 0.18/0.46 cnf(i_0_221, plain, (r(exist,u6r1(exist))), inference(extension_rule, [i_0_74])). % 0.18/0.46 cnf(i_0_357, plain, (~r(exist,u6r1(exist))), inference(closure_rule, [i_0_221])). % 0.18/0.46 # End printing tableau % 0.18/0.46 # SZS output end % 0.18/0.46 # Branches closed with saturation will be marked with an "s" % 0.18/0.46 # Child (19873) has found a proof. % 0.18/0.46 % 0.18/0.46 # Proof search is over... % 0.18/0.46 # Freeing feature tree %------------------------------------------------------------------------------