%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : PUZ056-2.005 : TPTP v8.1.0. Released v3.5.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 : n029.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:11:04 EDT 2022 % Result : Unsatisfiable 0.87s 1.10s % Output : CNFRefutation 0.87s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : PUZ056-2.005 : TPTP v8.1.0. Released v3.5.0. % 0.12/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n029.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sat May 28 23:02:58 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PS_S0Y % 0.13/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 16 Number of unprocessed: 16 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.87/1.05 # The folding up rule is enabled... % 0.87/1.05 # Local unification is enabled... % 0.87/1.05 # Any saturation attempts will use folding labels... % 0.87/1.05 # 16 beginning clauses after preprocessing and clausification % 0.87/1.05 # Creating start rules for all 1 conjectures. % 0.87/1.05 # There are 1 start rule candidates: % 0.87/1.05 # Found 11 unit axioms. % 0.87/1.05 # 1 start rule tableaux created. % 0.87/1.05 # 5 extension rule candidate clauses % 0.87/1.05 # 11 unit axiom clauses % 0.87/1.05 % 0.87/1.05 # Requested 8, 32 cores available to the main process. % 0.87/1.05 # There are not enough tableaux to fork, creating more from the initial 1 % 0.87/1.10 # There were 5 total branch saturation attempts. % 0.87/1.10 # There were 0 of these attempts blocked. % 0.87/1.10 # There were 0 deferred branch saturation attempts. % 0.87/1.10 # There were 3 free duplicated saturations. % 0.87/1.10 # There were 5 total successful branch saturations. % 0.87/1.10 # There were 0 successful branch saturations in interreduction. % 0.87/1.10 # There were 0 successful branch saturations on the branch. % 0.87/1.10 # There were 2 successful branch saturations after the branch. % 0.87/1.10 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.87/1.10 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.87/1.10 # Begin clausification derivation % 0.87/1.10 % 0.87/1.10 # End clausification derivation % 0.87/1.10 # Begin listing active clauses obtained from FOF to CNF conversion % 0.87/1.10 cnf(i_0_24, plain, (neq(s0,s2))). % 0.87/1.10 cnf(i_0_23, plain, (neq(s0,s1))). % 0.87/1.10 cnf(i_0_27, plain, (neq(s1,s2))). % 0.87/1.10 cnf(i_0_25, plain, (neq(s1,s0))). % 0.87/1.10 cnf(i_0_28, plain, (neq(s2,s0))). % 0.87/1.10 cnf(i_0_29, plain, (neq(s2,s1))). % 0.87/1.10 cnf(i_0_31, plain, (p(s0,s0,s0,s0,s0))). % 0.87/1.10 cnf(i_0_30, plain, (~neq(s2,s2))). % 0.87/1.10 cnf(i_0_32, negated_conjecture, (~p(s2,s2,s2,s2,s2))). % 0.87/1.10 cnf(i_0_22, plain, (~neq(s0,s0))). % 0.87/1.10 cnf(i_0_26, plain, (~neq(s1,s1))). % 0.87/1.10 cnf(i_0_17, plain, (p(X1,X2,X3,X4,X5)|~p(X6,X2,X3,X4,X5))). % 0.87/1.10 cnf(i_0_18, plain, (p(X1,X2,X3,X4,X5)|~neq(X1,X2)|~neq(X1,X6)|~p(X1,X6,X3,X4,X5))). % 0.87/1.10 cnf(i_0_19, plain, (p(X1,X2,X3,X4,X5)|~neq(X2,X3)|~neq(X2,X6)|~neq(X1,X3)|~neq(X1,X6)|~p(X1,X2,X6,X4,X5))). % 0.87/1.10 cnf(i_0_20, plain, (p(X1,X2,X3,X4,X5)|~neq(X3,X4)|~neq(X3,X6)|~neq(X2,X4)|~neq(X2,X6)|~neq(X1,X4)|~neq(X1,X6)|~p(X1,X2,X3,X6,X5))). % 0.87/1.10 cnf(i_0_21, plain, (p(X1,X2,X3,X4,X5)|~neq(X4,X5)|~neq(X4,X6)|~neq(X3,X5)|~neq(X3,X6)|~neq(X2,X5)|~neq(X2,X6)|~neq(X1,X5)|~neq(X1,X6)|~p(X1,X2,X3,X4,X6))). % 0.87/1.10 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.87/1.10 # Begin printing tableau % 0.87/1.10 # Found 12 steps % 0.87/1.10 cnf(i_0_32, negated_conjecture, (~p(s2,s2,s2,s2,s2)), inference(start_rule)). % 0.87/1.10 cnf(i_0_33, plain, (~p(s2,s2,s2,s2,s2)), inference(extension_rule, [i_0_21])). % 0.87/1.10 cnf(i_0_56, plain, (~neq(s2,s0)), inference(closure_rule, [i_0_28])). % 0.87/1.10 cnf(i_0_58, plain, (~neq(s2,s0)), inference(closure_rule, [i_0_28])). % 0.87/1.10 cnf(i_0_60, plain, (~neq(s2,s0)), inference(closure_rule, [i_0_28])). % 0.87/1.10 cnf(i_0_62, plain, (~neq(s2,s0)), inference(closure_rule, [i_0_28])). % 0.87/1.10 cnf(i_0_63, plain, (~p(s2,s2,s2,s2,s0)), inference(extension_rule, [i_0_17])). % 0.87/1.10 cnf(i_0_55, plain, (~neq(s2,s2)), inference(etableau_closure_rule, [i_0_55, ...])). % 0.87/1.10 cnf(i_0_57, plain, (~neq(s2,s2)), inference(etableau_closure_rule, [i_0_57, ...])). % 0.87/1.10 cnf(i_0_59, plain, (~neq(s2,s2)), inference(etableau_closure_rule, [i_0_59, ...])). % 0.87/1.10 cnf(i_0_61, plain, (~neq(s2,s2)), inference(etableau_closure_rule, [i_0_61, ...])). % 0.87/1.10 cnf(i_0_185, plain, (~p(X12,s2,s2,s2,s0)), inference(etableau_closure_rule, [i_0_185, ...])). % 0.87/1.10 # End printing tableau % 0.87/1.10 # SZS output end % 0.87/1.10 # Branches closed with saturation will be marked with an "s" % 0.87/1.10 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux. % 0.87/1.10 # We now have 5 tableaux to operate on % 0.87/1.10 # Found closed tableau during pool population. % 0.87/1.10 # Proof search is over... % 0.87/1.10 # Freeing feature tree %------------------------------------------------------------------------------