%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS009-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 : n025.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.12s 0.39s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : KRS009-1 : TPTP v8.1.0. Released v2.0.0. % 0.07/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 : n025.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.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jun 7 07:54:03 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C47_F1_SE_CS_SP_PS_S0Y % 0.12/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 41 Number of unprocessed: 41 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 41 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 1 conjectures. % 0.12/0.38 # There are 1 start rule candidates: % 0.12/0.38 # Found 1 unit axioms. % 0.12/0.38 # 1 start rule tableaux created. % 0.12/0.38 # 40 extension rule candidate clauses % 0.12/0.38 # 1 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Requested 8, 32 cores available to the main process. % 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.38 # 26950 Satisfiable branch % 0.12/0.39 # Satisfiable branch found. % 0.12/0.39 # There were 1 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 0 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 0 successful branch saturations after the branch. % 0.12/0.39 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_42, negated_conjecture, (e(exist))). % 0.12/0.39 cnf(i_0_62, plain, (s1most(X1)|~e(X1))). % 0.12/0.39 cnf(i_0_63, plain, (r1most(X1)|~e(X1))). % 0.12/0.39 cnf(i_0_64, plain, (t3least(X1)|~e(X1))). % 0.12/0.39 cnf(i_0_43, plain, (p2least(X1)|~c(X1))). % 0.12/0.39 cnf(i_0_44, plain, (c(X1)|~p2least(X1))). % 0.12/0.39 cnf(i_0_49, plain, (p1most(X1)|~d(X1))). % 0.12/0.39 cnf(i_0_50, plain, (d(X1)|~p1most(X1))). % 0.12/0.39 cnf(i_0_57, plain, (a(X1)|~c(X1))). % 0.12/0.39 cnf(i_0_56, plain, (a(X1)|~d(X1))). % 0.12/0.39 cnf(i_0_58, plain, (c(X1)|~r(X2,X1))). % 0.12/0.39 cnf(i_0_60, plain, (d(X1)|~s(X2,X1))). % 0.12/0.39 cnf(i_0_65, plain, (a(X1)|~t(X2,X1)|~e(X2))). % 0.12/0.39 cnf(i_0_55, plain, (d(X1)|c(X1)|~a(X1))). % 0.12/0.39 cnf(i_0_45, plain, (~equalish(u1r2(X1),u1r1(X1))|~p2least(X1))). % 0.12/0.39 cnf(i_0_68, plain, (~t3least(X1)|~equalish(u8r2(X1),u8r1(X1)))). % 0.12/0.39 cnf(i_0_54, plain, (p1most(X1)|p(X1,u3r2(X1)))). % 0.12/0.39 cnf(i_0_59, plain, (t(X1,X2)|~r(X1,X2))). % 0.12/0.39 cnf(i_0_70, plain, (~t3least(X1)|~equalish(u8r3(X1),u8r2(X1)))). % 0.12/0.39 cnf(i_0_69, plain, (~t3least(X1)|~equalish(u8r3(X1),u8r1(X1)))). % 0.12/0.39 cnf(i_0_61, plain, (t(X1,X2)|~s(X1,X2))). % 0.12/0.39 cnf(i_0_52, plain, (p1most(X1)|~equalish(u3r2(X1),u3r1(X1)))). % 0.12/0.39 cnf(i_0_53, plain, (p1most(X1)|p(X1,u3r1(X1)))). % 0.12/0.39 cnf(i_0_80, plain, (s1most(X1)|~equalish(u10r2(X1),u10r1(X1)))). % 0.12/0.39 cnf(i_0_76, plain, (r1most(X1)|~equalish(u9r2(X1),u9r1(X1)))). % 0.12/0.39 cnf(i_0_47, plain, (p(X1,u1r2(X1))|~p2least(X1))). % 0.12/0.39 cnf(i_0_46, plain, (p(X1,u1r1(X1))|~p2least(X1))). % 0.12/0.39 cnf(i_0_82, plain, (s1most(X1)|s(X1,u10r2(X1)))). % 0.12/0.39 cnf(i_0_81, plain, (s1most(X1)|s(X1,u10r1(X1)))). % 0.12/0.39 cnf(i_0_72, plain, (t(X1,u8r2(X1))|~t3least(X1))). % 0.12/0.39 cnf(i_0_71, plain, (t(X1,u8r1(X1))|~t3least(X1))). % 0.12/0.39 cnf(i_0_73, plain, (t(X1,u8r3(X1))|~t3least(X1))). % 0.12/0.39 cnf(i_0_66, plain, (e(X1)|~t3least(X1)|~r1most(X1)|~s1most(X1)|~a(u7r1(X1)))). % 0.12/0.39 cnf(i_0_78, plain, (r1most(X1)|r(X1,u9r2(X1)))). % 0.12/0.39 cnf(i_0_77, plain, (r1most(X1)|r(X1,u9r1(X1)))). % 0.12/0.39 cnf(i_0_67, plain, (t(X1,u7r1(X1))|e(X1)|~t3least(X1)|~r1most(X1)|~s1most(X1))). % 0.12/0.39 cnf(i_0_51, plain, (equalish(X1,X2)|~p1most(X3)|~p(X3,X2)|~p(X3,X1))). % 0.12/0.39 cnf(i_0_79, plain, (equalish(X1,X2)|~s1most(X3)|~s(X3,X2)|~s(X3,X1))). % 0.12/0.39 cnf(i_0_48, plain, (equalish(X1,X2)|p2least(X3)|~p(X3,X2)|~p(X3,X1))). % 0.12/0.39 cnf(i_0_75, plain, (equalish(X1,X2)|~r1most(X3)|~r(X3,X2)|~r(X3,X1))). % 0.12/0.39 cnf(i_0_74, plain, (t3least(X1)|equalish(X2,X3)|equalish(X2,X4)|equalish(X3,X4)|~t(X1,X4)|~t(X1,X3)|~t(X1,X2))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 3 steps % 0.12/0.39 cnf(i_0_42, negated_conjecture, (e(exist)), inference(start_rule)). % 0.12/0.39 cnf(i_0_83, plain, (e(exist)), inference(extension_rule, [i_0_65])). % 0.12/0.39 cnf(i_0_107, plain, (~t(exist,u8r2(exist))), inference(extension_rule, [i_0_72])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.12/0.39 # We now have 8 tableaux to operate on % 0.12/0.39 # Found closed tableau during pool population. % 0.12/0.39 # Proof search is over... % 0.12/0.39 # Freeing feature tree %------------------------------------------------------------------------------