%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ028-2 : TPTP v8.1.0. Bugfixed v1.2.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 : Mon Jul 18 18:10:59 EDT 2022 % Result : Satisfiable 0.20s 0.40s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : PUZ028-2 : TPTP v8.1.0. Bugfixed v1.2.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.34 % Computer : n025.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % 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 : Sat May 28 22:38:26 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___208_C18_F1_SE_CS_SP_PS_S4b % 0.14/0.37 # and selection function SelectCQIPrecW. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 39 Number of unprocessed: 39 % 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 # 39 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 2 conjectures. % 0.20/0.37 # There are 2 start rule candidates: % 0.20/0.37 # Found 36 unit axioms. % 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.37 # 2 start rule tableaux created. % 0.20/0.37 # 3 extension rule candidate clauses % 0.20/0.37 # 36 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.20/0.37 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 8 tableaux to operate on % 0.20/0.40 # 20448 Satisfiable branch % 0.20/0.40 # Satisfiable branch found. % 0.20/0.40 # There were 1 total branch saturation attempts. % 0.20/0.40 # There were 0 of these attempts blocked. % 0.20/0.40 # There were 0 deferred branch saturation attempts. % 0.20/0.40 # There were 0 free duplicated saturations. % 0.20/0.40 # There were 0 total successful branch saturations. % 0.20/0.40 # There were 0 successful branch saturations in interreduction. % 0.20/0.40 # There were 0 successful branch saturations on the branch. % 0.20/0.40 # There were 0 successful branch saturations after the branch. % 0.20/0.40 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.40 # Begin clausification derivation % 0.20/0.40 % 0.20/0.40 # End clausification derivation % 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.40 cnf(i_0_40, plain, (person(n1))). % 0.20/0.40 cnf(i_0_41, plain, (person(n2))). % 0.20/0.40 cnf(i_0_42, plain, (person(n3))). % 0.20/0.40 cnf(i_0_43, plain, (person(n4))). % 0.20/0.40 cnf(i_0_44, plain, (person(n5))). % 0.20/0.40 cnf(i_0_45, plain, (person(n6))). % 0.20/0.40 cnf(i_0_46, plain, (not_equal(n1,n2))). % 0.20/0.40 cnf(i_0_47, plain, (not_equal(n1,n3))). % 0.20/0.40 cnf(i_0_48, plain, (not_equal(n1,n4))). % 0.20/0.40 cnf(i_0_49, plain, (not_equal(n1,n5))). % 0.20/0.40 cnf(i_0_50, plain, (not_equal(n1,n6))). % 0.20/0.40 cnf(i_0_51, plain, (not_equal(n2,n1))). % 0.20/0.40 cnf(i_0_52, plain, (not_equal(n2,n3))). % 0.20/0.40 cnf(i_0_53, plain, (not_equal(n2,n4))). % 0.20/0.40 cnf(i_0_54, plain, (not_equal(n2,n5))). % 0.20/0.40 cnf(i_0_55, plain, (not_equal(n2,n6))). % 0.20/0.40 cnf(i_0_56, plain, (not_equal(n3,n1))). % 0.20/0.40 cnf(i_0_57, plain, (not_equal(n3,n2))). % 0.20/0.40 cnf(i_0_58, plain, (not_equal(n3,n4))). % 0.20/0.40 cnf(i_0_59, plain, (not_equal(n3,n5))). % 0.20/0.40 cnf(i_0_60, plain, (not_equal(n3,n6))). % 0.20/0.40 cnf(i_0_61, plain, (not_equal(n4,n1))). % 0.20/0.40 cnf(i_0_62, plain, (not_equal(n4,n2))). % 0.20/0.40 cnf(i_0_63, plain, (not_equal(n4,n3))). % 0.20/0.40 cnf(i_0_64, plain, (not_equal(n4,n5))). % 0.20/0.40 cnf(i_0_65, plain, (not_equal(n4,n6))). % 0.20/0.40 cnf(i_0_66, plain, (not_equal(n5,n1))). % 0.20/0.40 cnf(i_0_67, plain, (not_equal(n5,n2))). % 0.20/0.40 cnf(i_0_68, plain, (not_equal(n5,n3))). % 0.20/0.40 cnf(i_0_69, plain, (not_equal(n5,n4))). % 0.20/0.40 cnf(i_0_70, plain, (not_equal(n5,n6))). % 0.20/0.40 cnf(i_0_71, plain, (not_equal(n6,n1))). % 0.20/0.40 cnf(i_0_72, plain, (not_equal(n6,n2))). % 0.20/0.40 cnf(i_0_73, plain, (not_equal(n6,n3))). % 0.20/0.40 cnf(i_0_74, plain, (not_equal(n6,n4))). % 0.20/0.40 cnf(i_0_75, plain, (not_equal(n6,n5))). % 0.20/0.40 cnf(i_0_77, negated_conjecture, (~familiar(X1,X2)|~familiar(X3,X1)|~familiar(X2,X3))). % 0.20/0.40 cnf(i_0_78, negated_conjecture, (~not_familiar(X1,X2)|~not_familiar(X3,X1)|~not_familiar(X2,X3))). % 0.20/0.40 cnf(i_0_76, plain, (not_familiar(X1,X2)|familiar(X1,X2)|~not_equal(X1,X2)|~person(X2)|~person(X1))). % 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.40 # Begin printing tableau % 0.20/0.40 # Found 17 steps % 0.20/0.40 cnf(i_0_78, negated_conjecture, (~not_familiar(n1,n2)|~not_familiar(n2,n1)|~not_familiar(n2,n2)), inference(start_rule)). % 0.20/0.40 cnf(i_0_79, plain, (~not_familiar(n1,n2)), inference(extension_rule, [i_0_76])). % 0.20/0.40 cnf(i_0_87, plain, (~not_equal(n1,n2)), inference(closure_rule, [i_0_46])). % 0.20/0.40 cnf(i_0_88, plain, (~person(n2)), inference(closure_rule, [i_0_41])). % 0.20/0.40 cnf(i_0_89, plain, (~person(n1)), inference(closure_rule, [i_0_40])). % 0.20/0.40 cnf(i_0_86, plain, (familiar(n1,n2)), inference(extension_rule, [i_0_77])). % 0.20/0.40 cnf(i_0_171, plain, (~familiar(n2,n1)), inference(extension_rule, [i_0_76])). % 0.20/0.40 cnf(i_0_175, plain, (~not_equal(n2,n1)), inference(closure_rule, [i_0_51])). % 0.20/0.40 cnf(i_0_176, plain, (~person(n1)), inference(closure_rule, [i_0_40])). % 0.20/0.40 cnf(i_0_177, plain, (~person(n2)), inference(closure_rule, [i_0_41])). % 0.20/0.40 cnf(i_0_172, plain, (~familiar(n2,n2)), inference(extension_rule, [i_0_76])). % 0.20/0.40 cnf(i_0_187, plain, (~person(n2)), inference(closure_rule, [i_0_41])). % 0.20/0.40 cnf(i_0_188, plain, (~person(n2)), inference(closure_rule, [i_0_41])). % 0.20/0.40 cnf(i_0_80, plain, (~not_familiar(n2,n1)), inference(extension_rule, [i_0_76])). % 0.20/0.40 cnf(i_0_197, plain, (~not_equal(n2,n1)), inference(closure_rule, [i_0_51])). % 0.20/0.40 cnf(i_0_198, plain, (~person(n1)), inference(closure_rule, [i_0_40])). % 0.20/0.40 cnf(i_0_199, plain, (~person(n2)), inference(closure_rule, [i_0_41])). % 0.20/0.40 # End printing tableau % 0.20/0.40 # SZS output end % 0.20/0.40 # Branches closed with saturation will be marked with an "s" % 0.20/0.40 # 20441 Satisfiable branch % 0.20/0.40 # 20442 Satisfiable branch % 0.20/0.40 # 20444 Satisfiable branch % 0.20/0.40 # 20443 Satisfiable branch % 0.20/0.40 # Child (20448) has found a proof. % 0.20/0.40 % 0.20/0.40 # 20445 Satisfiable branch % 0.20/0.40 # Proof search is over... % 0.20/0.40 # Freeing feature tree %------------------------------------------------------------------------------