%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS011-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 : n020.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.11s 0.38s % Output : CNFRefutation 0.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : KRS011-1 : TPTP v8.1.0. Released v2.0.0. % 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.34 % Computer : n020.cluster.edu % 0.11/0.34 % Model : x86_64 x86_64 % 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.34 % Memory : 8042.1875MB % 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.34 % CPULimit : 300 % 0.11/0.34 % WCLimit : 600 % 0.11/0.34 % DateTime : Tue Jun 7 07:51:06 EDT 2022 % 0.11/0.34 % CPUTime : % 0.11/0.37 # No SInE strategy applied % 0.11/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI % 0.11/0.37 # and selection function SelectNewComplexAHP. % 0.11/0.37 # % 0.11/0.37 # Presaturation interreduction done % 0.11/0.37 # Number of axioms: 54 Number of unprocessed: 51 % 0.11/0.37 # Tableaux proof search. % 0.11/0.37 # APR header successfully linked. % 0.11/0.37 # Hello from C++ % 0.11/0.38 # The folding up rule is enabled... % 0.11/0.38 # Local unification is enabled... % 0.11/0.38 # Any saturation attempts will use folding labels... % 0.11/0.38 # 51 beginning clauses after preprocessing and clausification % 0.11/0.38 # Creating start rules for all 2 conjectures. % 0.11/0.38 # There are 2 start rule candidates: % 0.11/0.38 # Found 2 unit axioms. % 0.11/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.11/0.38 # 2 start rule tableaux created. % 0.11/0.38 # 49 extension rule candidate clauses % 0.11/0.38 # 2 unit axiom clauses % 0.11/0.38 % 0.11/0.38 # Requested 8, 32 cores available to the main process. % 0.11/0.38 # There are not enough tableaux to fork, creating more from the initial 2 % 0.11/0.38 # 8458 Satisfiable branch % 0.11/0.38 # Satisfiable branch found. % 0.11/0.38 # There were 1 total branch saturation attempts. % 0.11/0.38 # There were 0 of these attempts blocked. % 0.11/0.38 # There were 0 deferred branch saturation attempts. % 0.11/0.38 # There were 0 free duplicated saturations. % 0.11/0.38 # There were 0 total successful branch saturations. % 0.11/0.38 # There were 0 successful branch saturations in interreduction. % 0.11/0.38 # There were 0 successful branch saturations on the branch. % 0.11/0.38 # There were 0 successful branch saturations after the branch. % 0.11/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.11/0.38 # Begin clausification derivation % 0.11/0.38 % 0.11/0.38 # End clausification derivation % 0.11/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.11/0.38 cnf(i_0_55, negated_conjecture, (f(exists))). % 0.11/0.38 cnf(i_0_56, negated_conjecture, (~g(exists))). % 0.11/0.38 cnf(i_0_104, plain, (g(X1)|~r2least(X1))). % 0.11/0.38 cnf(i_0_101, plain, (f1(X1)|~f(X1))). % 0.11/0.38 cnf(i_0_100, plain, (f2(X1)|~f(X1))). % 0.11/0.38 cnf(i_0_99, plain, (f3(X1)|~f(X1))). % 0.11/0.38 cnf(i_0_103, plain, (r2least(X1)|~g(X1))). % 0.11/0.38 cnf(i_0_63, plain, (~e(X1)|~c(X1))). % 0.11/0.38 cnf(i_0_64, plain, (~d(X1)|~c(X1))). % 0.11/0.38 cnf(i_0_65, plain, (~d(X1)|~e(X1))). % 0.11/0.38 cnf(i_0_105, plain, (~r2least(X1)|~equalish(u14r2(X1),u14r1(X1)))). % 0.11/0.38 cnf(i_0_102, plain, (f(X1)|~f3(X1)|~f2(X1)|~f1(X1))). % 0.11/0.38 cnf(i_0_69, plain, (c(u9r5(X1))|~f1(X1))). % 0.11/0.38 cnf(i_0_89, plain, (e(u11r5(X1))|~f3(X1))). % 0.11/0.38 cnf(i_0_79, plain, (d(u10r5(X1))|~f2(X1))). % 0.11/0.38 cnf(i_0_60, plain, (t(X1,X2)|~t1(X1,X2))). % 0.11/0.38 cnf(i_0_61, plain, (t(X1,X2)|~t2(X1,X2))). % 0.11/0.38 cnf(i_0_62, plain, (t(X1,X2)|~t3(X1,X2))). % 0.11/0.38 cnf(i_0_107, plain, (r(X1,u14r2(X1))|~r2least(X1))). % 0.11/0.38 cnf(i_0_106, plain, (r(X1,u14r1(X1))|~r2least(X1))). % 0.11/0.38 cnf(i_0_57, plain, (r(X1,X2)|~r1(X1,X2))). % 0.11/0.38 cnf(i_0_58, plain, (r(X1,X2)|~r2(X1,X2))). % 0.11/0.38 cnf(i_0_59, plain, (r(X1,X2)|~r3(X1,X2))). % 0.11/0.38 cnf(i_0_72, plain, (r1(X1,u9r4(X1))|~f1(X1))). % 0.11/0.38 cnf(i_0_82, plain, (r2(X1,u10r4(X1))|~f2(X1))). % 0.11/0.38 cnf(i_0_92, plain, (r3(X1,u11r4(X1))|~f3(X1))). % 0.11/0.38 cnf(i_0_70, plain, (t1(u9r4(X1),u9r5(X1))|~f1(X1))). % 0.11/0.38 cnf(i_0_80, plain, (t2(u10r4(X1),u10r5(X1))|~f2(X1))). % 0.11/0.38 cnf(i_0_90, plain, (t3(u11r4(X1),u11r5(X1))|~f3(X1))). % 0.11/0.38 cnf(i_0_108, plain, (r2least(X1)|equalish(X2,X3)|~r(X1,X3)|~r(X1,X2))). % 0.11/0.38 cnf(i_0_77, plain, (f1(X1)|t(X2,u9r2(X2,X1))|~c(X3)|~t1(X2,X3)|~r1(X1,X2))). % 0.11/0.38 cnf(i_0_73, plain, (f1(X1)|~equalish(u9r2(X2,X1),u9r1(X2,X1))|~c(X3)|~t1(X2,X3)|~r1(X1,X2))). % 0.11/0.38 cnf(i_0_75, plain, (f1(X1)|~equalish(u9r3(X2,X1),u9r2(X2,X1))|~c(X3)|~t1(X2,X3)|~r1(X1,X2))). % 0.11/0.38 cnf(i_0_74, plain, (f1(X1)|~equalish(u9r3(X2,X1),u9r1(X2,X1))|~c(X3)|~t1(X2,X3)|~r1(X1,X2))). % 0.11/0.38 cnf(i_0_83, plain, (f2(X1)|~equalish(u10r2(X2,X1),u10r1(X2,X1))|~d(X3)|~t2(X2,X3)|~r2(X1,X2))). % 0.11/0.38 cnf(i_0_76, plain, (f1(X1)|t(X2,u9r1(X2,X1))|~c(X3)|~t1(X2,X3)|~r1(X1,X2))). % 0.11/0.38 cnf(i_0_78, plain, (f1(X1)|t(X2,u9r3(X2,X1))|~c(X3)|~t1(X2,X3)|~r1(X1,X2))). % 0.11/0.38 cnf(i_0_85, plain, (f2(X1)|~equalish(u10r3(X2,X1),u10r2(X2,X1))|~d(X3)|~t2(X2,X3)|~r2(X1,X2))). % 0.11/0.38 cnf(i_0_84, plain, (f2(X1)|~equalish(u10r3(X2,X1),u10r1(X2,X1))|~d(X3)|~t2(X2,X3)|~r2(X1,X2))). % 0.11/0.38 cnf(i_0_93, plain, (f3(X1)|~equalish(u11r2(X2,X1),u11r1(X2,X1))|~e(X3)|~t3(X2,X3)|~r3(X1,X2))). % 0.11/0.38 cnf(i_0_95, plain, (f3(X1)|~equalish(u11r3(X2,X1),u11r2(X2,X1))|~e(X3)|~t3(X2,X3)|~r3(X1,X2))). % 0.11/0.38 cnf(i_0_87, plain, (f2(X1)|t(X2,u10r2(X2,X1))|~d(X3)|~t2(X2,X3)|~r2(X1,X2))). % 0.11/0.38 cnf(i_0_94, plain, (f3(X1)|~equalish(u11r3(X2,X1),u11r1(X2,X1))|~e(X3)|~t3(X2,X3)|~r3(X1,X2))). % 0.11/0.38 cnf(i_0_86, plain, (f2(X1)|t(X2,u10r1(X2,X1))|~d(X3)|~t2(X2,X3)|~r2(X1,X2))). % 0.11/0.38 cnf(i_0_88, plain, (f2(X1)|t(X2,u10r3(X2,X1))|~d(X3)|~t2(X2,X3)|~r2(X1,X2))). % 0.11/0.38 cnf(i_0_97, plain, (f3(X1)|t(X2,u11r2(X2,X1))|~e(X3)|~t3(X2,X3)|~r3(X1,X2))). % 0.11/0.38 cnf(i_0_96, plain, (f3(X1)|t(X2,u11r1(X2,X1))|~e(X3)|~t3(X2,X3)|~r3(X1,X2))). % 0.11/0.38 cnf(i_0_98, plain, (f3(X1)|t(X2,u11r3(X2,X1))|~e(X3)|~t3(X2,X3)|~r3(X1,X2))). % 0.11/0.38 cnf(i_0_71, plain, (equalish(X1,X2)|equalish(X1,X3)|equalish(X2,X3)|~f1(X4)|~t(u9r4(X4),X3)|~t(u9r4(X4),X2)|~t(u9r4(X4),X1))). % 0.11/0.38 cnf(i_0_81, plain, (equalish(X1,X2)|equalish(X1,X3)|equalish(X2,X3)|~f2(X4)|~t(u10r4(X4),X3)|~t(u10r4(X4),X2)|~t(u10r4(X4),X1))). % 0.11/0.38 cnf(i_0_91, plain, (equalish(X1,X2)|equalish(X1,X3)|equalish(X2,X3)|~f3(X4)|~t(u11r4(X4),X3)|~t(u11r4(X4),X2)|~t(u11r4(X4),X1))). % 0.11/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.11/0.38 # Begin printing tableau % 0.11/0.38 # Found 3 steps % 0.11/0.38 cnf(i_0_55, negated_conjecture, (f(exists)), inference(start_rule)). % 0.11/0.38 cnf(i_0_110, plain, (f(exists)), inference(extension_rule, [i_0_99])). % 0.11/0.38 cnf(i_0_288, plain, (f3(exists)), inference(extension_rule, [i_0_89])). % 0.11/0.38 # End printing tableau % 0.11/0.38 # SZS output end % 0.11/0.38 # Branches closed with saturation will be marked with an "s" % 0.11/0.38 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.11/0.38 # We now have 4 tableaux to operate on % 0.11/0.38 # Found closed tableau during pool population. % 0.11/0.38 # Proof search is over... % 0.11/0.38 # Freeing feature tree %------------------------------------------------------------------------------