%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS006-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 : n021.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.19s 0.37s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS006-1 : TPTP v8.1.0. Released v2.0.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n021.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.19/0.34 % CPULimit : 300 % 0.19/0.34 % WCLimit : 600 % 0.19/0.34 % DateTime : Tue Jun 7 09:39:51 EDT 2022 % 0.19/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 27 Number of unprocessed: 27 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 27 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 5 conjectures. % 0.19/0.37 # There are 5 start rule candidates: % 0.19/0.37 # Found 5 unit axioms. % 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.37 # 5 start rule tableaux created. % 0.19/0.37 # 22 extension rule candidate clauses % 0.19/0.37 # 5 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 5 % 0.19/0.37 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 10 tableaux to operate on % 0.19/0.37 # 5290 Satisfiable branch % 0.19/0.37 # 5292 Satisfiable branch % 0.19/0.37 # 5294 Satisfiable branch % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # Satisfiable branch found. % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 0 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 0 successful branch saturations after the branch. % 0.19/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_28, negated_conjecture, (e(exist))). % 0.19/0.37 cnf(i_0_29, negated_conjecture, (r1most(exist))). % 0.19/0.37 cnf(i_0_31, negated_conjecture, (d(u4r2(exist)))). % 0.19/0.37 cnf(i_0_32, negated_conjecture, (c(u4r1(exist)))). % 0.19/0.37 cnf(i_0_30, negated_conjecture, (r(exist,u4r1(exist)))). % 0.19/0.37 cnf(i_0_49, plain, (r1most(X1)|~e(X1))). % 0.19/0.37 cnf(i_0_40, plain, (d(X1)|~s1most(X1))). % 0.19/0.37 cnf(i_0_33, plain, (s2least(X1)|~c(X1))). % 0.19/0.37 cnf(i_0_39, plain, (s1most(X1)|~d(X1))). % 0.19/0.37 cnf(i_0_34, plain, (c(X1)|~s2least(X1))). % 0.19/0.37 cnf(i_0_35, plain, (~equalish(u1r2(X1),u1r1(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_45, plain, (d(u4r2(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_47, plain, (c(u4r1(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_48, plain, (r(X1,u4r1(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_46, plain, (r(X1,u4r2(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_54, plain, (r(X1,u5r2(X1))|r1most(X1))). % 0.19/0.37 cnf(i_0_53, plain, (r(X1,u5r1(X1))|r1most(X1))). % 0.19/0.37 cnf(i_0_44, plain, (s1most(X1)|s(X1,u3r2(X1)))). % 0.19/0.37 cnf(i_0_52, plain, (r1most(X1)|~equalish(u5r2(X1),u5r1(X1)))). % 0.19/0.37 cnf(i_0_42, plain, (s1most(X1)|~equalish(u3r2(X1),u3r1(X1)))). % 0.19/0.37 cnf(i_0_37, plain, (s(X1,u1r2(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_36, plain, (s(X1,u1r1(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_43, plain, (s1most(X1)|s(X1,u3r1(X1)))). % 0.19/0.37 cnf(i_0_50, plain, (e(X1)|~c(X2)|~d(X3)|~r(X1,X3)|~r(X1,X2)|~r1most(X1))). % 0.19/0.37 cnf(i_0_51, plain, (equalish(X1,X2)|~r(X3,X2)|~r(X3,X1)|~r1most(X3))). % 0.19/0.37 cnf(i_0_41, plain, (equalish(X1,X2)|~s1most(X3)|~s(X3,X2)|~s(X3,X1))). % 0.19/0.37 cnf(i_0_38, plain, (equalish(X1,X2)|s2least(X3)|~s(X3,X2)|~s(X3,X1))). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 5 steps % 0.19/0.37 cnf(i_0_28, negated_conjecture, (e(exist)), inference(start_rule)). % 0.19/0.37 cnf(i_0_59, plain, (e(exist)), inference(extension_rule, [i_0_49])). % 0.19/0.37 cnf(i_0_222, plain, (r1most(exist)), inference(extension_rule, [i_0_51])). % 0.19/0.37 cnf(i_0_265, plain, (~r(exist,u4r1(exist))), inference(closure_rule, [i_0_30])). % 0.19/0.37 cnf(i_0_266, plain, (~r(exist,u4r1(exist))), inference(closure_rule, [i_0_30])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # 5289 Satisfiable branch % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # Satisfiable branch found. % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 0 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 0 successful branch saturations after the branch. % 0.19/0.37 # Satisfiable branch found. % 0.19/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_28, negated_conjecture, (e(exist))). % 0.19/0.37 cnf(i_0_29, negated_conjecture, (r1most(exist))). % 0.19/0.37 cnf(i_0_31, negated_conjecture, (d(u4r2(exist)))). % 0.19/0.37 cnf(i_0_32, negated_conjecture, (c(u4r1(exist)))). % 0.19/0.37 cnf(i_0_30, negated_conjecture, (r(exist,u4r1(exist)))). % 0.19/0.37 cnf(i_0_49, plain, (r1most(X1)|~e(X1))). % 0.19/0.37 cnf(i_0_40, plain, (d(X1)|~s1most(X1))). % 0.19/0.37 cnf(i_0_33, plain, (s2least(X1)|~c(X1))). % 0.19/0.37 cnf(i_0_39, plain, (s1most(X1)|~d(X1))). % 0.19/0.37 cnf(i_0_34, plain, (c(X1)|~s2least(X1))). % 0.19/0.37 cnf(i_0_35, plain, (~equalish(u1r2(X1),u1r1(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_45, plain, (d(u4r2(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_47, plain, (c(u4r1(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_48, plain, (r(X1,u4r1(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_46, plain, (r(X1,u4r2(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_54, plain, (r(X1,u5r2(X1))|r1most(X1))). % 0.19/0.37 cnf(i_0_53, plain, (r(X1,u5r1(X1))|r1most(X1))). % 0.19/0.37 cnf(i_0_44, plain, (s1most(X1)|s(X1,u3r2(X1)))). % 0.19/0.37 cnf(i_0_52, plain, (r1most(X1)|~equalish(u5r2(X1),u5r1(X1)))). % 0.19/0.37 cnf(i_0_42, plain, (s1most(X1)|~equalish(u3r2(X1),u3r1(X1)))). % 0.19/0.37 cnf(i_0_37, plain, (s(X1,u1r2(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_36, plain, (s(X1,u1r1(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_43, plain, (s1most(X1)|s(X1,u3r1(X1)))). % 0.19/0.37 cnf(i_0_50, plain, (e(X1)|~c(X2)|~d(X3)|~r(X1,X3)|~r(X1,X2)|~r1most(X1))). % 0.19/0.37 cnf(i_0_51, plain, (equalish(X1,X2)|~r(X3,X2)|~r(X3,X1)|~r1most(X3))). % 0.19/0.37 cnf(i_0_41, plain, (equalish(X1,X2)|~s1most(X3)|~s(X3,X2)|~s(X3,X1))). % 0.19/0.37 cnf(i_0_38, plain, (equalish(X1,X2)|s2least(X3)|~s(X3,X2)|~s(X3,X1))). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 5 steps % 0.19/0.37 cnf(i_0_31, negated_conjecture, (d(u4r2(exist))), inference(start_rule)). % 0.19/0.37 cnf(i_0_57, plain, (d(u4r2(exist))), inference(extension_rule, [i_0_39])). % 0.19/0.37 cnf(i_0_174, plain, (s1most(u4r2(exist))), inference(extension_rule, [i_0_41])). % 0.19/0.37 cnf(i_0_268, plain, (equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist)))), inference(extension_rule, [i_0_35])). % 0.19/0.37 cnf(i_0_270, plain, (~s(u4r2(exist),u1r1(u4r2(exist)))), inference(extension_rule, [i_0_36])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # There were 1 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 0 total successful branch saturations. % 0.19/0.37 # There were 0 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 0 successful branch saturations after the branch. % 0.19/0.37 # Satisfiable branch found. % 0.19/0.37 # There were 2 total branch saturation attempts. % 0.19/0.37 # There were 0 of these attempts blocked. % 0.19/0.37 # There were 0 deferred branch saturation attempts. % 0.19/0.37 # There were 0 free duplicated saturations. % 0.19/0.37 # There were 1 total successful branch saturations. % 0.19/0.37 # There were 1 successful branch saturations in interreduction. % 0.19/0.37 # There were 0 successful branch saturations on the branch. % 0.19/0.37 # There were 0 successful branch saturations after the branch. % 0.19/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_28, negated_conjecture, (e(exist))). % 0.19/0.37 cnf(i_0_29, negated_conjecture, (r1most(exist))). % 0.19/0.37 cnf(i_0_31, negated_conjecture, (d(u4r2(exist)))). % 0.19/0.37 cnf(i_0_32, negated_conjecture, (c(u4r1(exist)))). % 0.19/0.37 cnf(i_0_30, negated_conjecture, (r(exist,u4r1(exist)))). % 0.19/0.37 cnf(i_0_49, plain, (r1most(X1)|~e(X1))). % 0.19/0.37 cnf(i_0_40, plain, (d(X1)|~s1most(X1))). % 0.19/0.37 cnf(i_0_33, plain, (s2least(X1)|~c(X1))). % 0.19/0.37 cnf(i_0_39, plain, (s1most(X1)|~d(X1))). % 0.19/0.37 cnf(i_0_34, plain, (c(X1)|~s2least(X1))). % 0.19/0.37 cnf(i_0_35, plain, (~equalish(u1r2(X1),u1r1(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_45, plain, (d(u4r2(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_47, plain, (c(u4r1(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_48, plain, (r(X1,u4r1(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_46, plain, (r(X1,u4r2(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_54, plain, (r(X1,u5r2(X1))|r1most(X1))). % 0.19/0.37 cnf(i_0_53, plain, (r(X1,u5r1(X1))|r1most(X1))). % 0.19/0.37 cnf(i_0_44, plain, (s1most(X1)|s(X1,u3r2(X1)))). % 0.19/0.37 cnf(i_0_52, plain, (r1most(X1)|~equalish(u5r2(X1),u5r1(X1)))). % 0.19/0.37 cnf(i_0_42, plain, (s1most(X1)|~equalish(u3r2(X1),u3r1(X1)))). % 0.19/0.37 cnf(i_0_37, plain, (s(X1,u1r2(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_36, plain, (s(X1,u1r1(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_43, plain, (s1most(X1)|s(X1,u3r1(X1)))). % 0.19/0.37 cnf(i_0_50, plain, (e(X1)|~c(X2)|~d(X3)|~r(X1,X3)|~r(X1,X2)|~r1most(X1))). % 0.19/0.37 cnf(i_0_51, plain, (equalish(X1,X2)|~r(X3,X2)|~r(X3,X1)|~r1most(X3))). % 0.19/0.37 cnf(i_0_41, plain, (equalish(X1,X2)|~s1most(X3)|~s(X3,X2)|~s(X3,X1))). % 0.19/0.37 cnf(i_0_38, plain, (equalish(X1,X2)|s2least(X3)|~s(X3,X2)|~s(X3,X1))). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 3 steps % 0.19/0.37 cnf(i_0_32, negated_conjecture, (c(u4r1(exist))), inference(start_rule)). % 0.19/0.37 cnf(i_0_56, plain, (c(u4r1(exist))), inference(extension_rule, [i_0_33])). % 0.19/0.37 cnf(i_0_118, plain, (s2least(u4r1(exist))), inference(extension_rule, [i_0_35])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.37 # Begin clausification derivation % 0.19/0.37 % 0.19/0.37 # End clausification derivation % 0.19/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.37 cnf(i_0_28, negated_conjecture, (e(exist))). % 0.19/0.37 cnf(i_0_29, negated_conjecture, (r1most(exist))). % 0.19/0.37 cnf(i_0_31, negated_conjecture, (d(u4r2(exist)))). % 0.19/0.37 cnf(i_0_32, negated_conjecture, (c(u4r1(exist)))). % 0.19/0.37 cnf(i_0_30, negated_conjecture, (r(exist,u4r1(exist)))). % 0.19/0.37 cnf(i_0_49, plain, (r1most(X1)|~e(X1))). % 0.19/0.37 cnf(i_0_40, plain, (d(X1)|~s1most(X1))). % 0.19/0.37 cnf(i_0_33, plain, (s2least(X1)|~c(X1))). % 0.19/0.37 cnf(i_0_39, plain, (s1most(X1)|~d(X1))). % 0.19/0.37 cnf(i_0_34, plain, (c(X1)|~s2least(X1))). % 0.19/0.37 cnf(i_0_35, plain, (~equalish(u1r2(X1),u1r1(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_45, plain, (d(u4r2(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_47, plain, (c(u4r1(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_48, plain, (r(X1,u4r1(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_46, plain, (r(X1,u4r2(X1))|~e(X1))). % 0.19/0.37 cnf(i_0_54, plain, (r(X1,u5r2(X1))|r1most(X1))). % 0.19/0.37 cnf(i_0_53, plain, (r(X1,u5r1(X1))|r1most(X1))). % 0.19/0.37 cnf(i_0_44, plain, (s1most(X1)|s(X1,u3r2(X1)))). % 0.19/0.37 cnf(i_0_52, plain, (r1most(X1)|~equalish(u5r2(X1),u5r1(X1)))). % 0.19/0.37 cnf(i_0_42, plain, (s1most(X1)|~equalish(u3r2(X1),u3r1(X1)))). % 0.19/0.37 cnf(i_0_37, plain, (s(X1,u1r2(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_36, plain, (s(X1,u1r1(X1))|~s2least(X1))). % 0.19/0.37 cnf(i_0_43, plain, (s1most(X1)|s(X1,u3r1(X1)))). % 0.19/0.37 cnf(i_0_50, plain, (e(X1)|~c(X2)|~d(X3)|~r(X1,X3)|~r(X1,X2)|~r1most(X1))). % 0.19/0.37 cnf(i_0_51, plain, (equalish(X1,X2)|~r(X3,X2)|~r(X3,X1)|~r1most(X3))). % 0.19/0.37 cnf(i_0_41, plain, (equalish(X1,X2)|~s1most(X3)|~s(X3,X2)|~s(X3,X1))). % 0.19/0.37 cnf(i_0_38, plain, (equalish(X1,X2)|s2least(X3)|~s(X3,X2)|~s(X3,X1))). % 0.19/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.37 # Begin printing tableau % 0.19/0.37 # Found 7 steps % 0.19/0.37 cnf(i_0_29, negated_conjecture, (r1most(exist)), inference(start_rule)). % 0.19/0.37 cnf(i_0_260, plain, (~d(u4r1(exist))), inference(closure_rule, [i_0_0])). % 0.19/0.37 cnf(i_0_58, plain, (r1most(exist)), inference(extension_rule, [i_0_50])). % 0.19/0.37 cnf(i_0_259, plain, (~c(u4r1(exist))), inference(closure_rule, [i_0_32])). % 0.19/0.37 cnf(i_0_258, plain, (e(exist)), inference(extension_rule, [i_0_45])). % 0.19/0.37 cnf(i_0_261, plain, (~r(exist,u4r1(exist))), inference(closure_rule, [i_0_30])). % 0.19/0.37 cnf(i_0_262, plain, (~r(exist,u4r1(exist))), inference(etableau_closure_rule, [i_0_262, ...])). % 0.19/0.37 # End printing tableau % 0.19/0.37 # SZS output end % 0.19/0.37 # Branches closed with saturation will be marked with an "s" % 0.19/0.37 # Child (5290) has found a proof. % 0.19/0.37 % 0.19/0.37 # Proof search is over... % 0.19/0.37 # Freeing feature tree %------------------------------------------------------------------------------