%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO169+2 : TPTP v8.1.0. Released v3.3.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 : n026.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 : Sat Jul 16 04:08:16 EDT 2022 % Result : Theorem 13.19s 2.11s % Output : CNFRefutation 13.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GEO169+2 : TPTP v8.1.0. Released v3.3.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.13/0.34 % Computer : n026.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jun 17 16:30:39 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 50 Number of unprocessed: 50 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 50 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 1 conjectures. % 0.13/0.38 # There are 1 start rule candidates: % 0.13/0.38 # Found 37 unit axioms. % 0.13/0.38 # 1 start rule tableaux created. % 0.13/0.38 # 13 extension rule candidate clauses % 0.13/0.38 # 37 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.38 # Creating equality axioms % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # Returning from population with 58 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 58 tableaux to operate on % 13.19/2.11 # There were 2 total branch saturation attempts. % 13.19/2.11 # There were 0 of these attempts blocked. % 13.19/2.11 # There were 0 deferred branch saturation attempts. % 13.19/2.11 # There were 0 free duplicated saturations. % 13.19/2.11 # There were 1 total successful branch saturations. % 13.19/2.11 # There were 0 successful branch saturations in interreduction. % 13.19/2.11 # There were 0 successful branch saturations on the branch. % 13.19/2.11 # There were 1 successful branch saturations after the branch. % 13.19/2.11 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 13.19/2.11 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 13.19/2.11 # Begin clausification derivation % 13.19/2.11 % 13.19/2.11 # End clausification derivation % 13.19/2.11 # Begin listing active clauses obtained from FOF to CNF conversion % 13.19/2.11 cnf(i_0_29, plain, (incident(p3,b1b2))). % 13.19/2.11 cnf(i_0_28, plain, (incident(p3,a1a2))). % 13.19/2.11 cnf(i_0_31, plain, (incident(p1,b2b3))). % 13.19/2.11 cnf(i_0_30, plain, (incident(p1,a2a3))). % 13.19/2.11 cnf(i_0_33, plain, (incident(p2,b3b1))). % 13.19/2.11 cnf(i_0_32, plain, (incident(p2,a3a1))). % 13.19/2.11 cnf(i_0_12, plain, (incident(a1,a3a1))). % 13.19/2.11 cnf(i_0_7, plain, (incident(a1,a1a2))). % 13.19/2.11 cnf(i_0_22, plain, (incident(a1,s1))). % 13.19/2.11 cnf(i_0_9, plain, (incident(a2,a2a3))). % 13.19/2.11 cnf(i_0_8, plain, (incident(a2,a1a2))). % 13.19/2.11 cnf(i_0_23, plain, (incident(a2,s2))). % 13.19/2.11 cnf(i_0_10, plain, (incident(a3,a2a3))). % 13.19/2.11 cnf(i_0_11, plain, (incident(a3,a3a1))). % 13.19/2.11 cnf(i_0_24, plain, (incident(a3,s3))). % 13.19/2.11 cnf(i_0_18, plain, (incident(b1,b3b1))). % 13.19/2.11 cnf(i_0_13, plain, (incident(b1,b1b2))). % 13.19/2.11 cnf(i_0_25, plain, (incident(b1,s1))). % 13.19/2.11 cnf(i_0_15, plain, (incident(b2,b2b3))). % 13.19/2.11 cnf(i_0_14, plain, (incident(b2,b1b2))). % 13.19/2.11 cnf(i_0_26, plain, (incident(b2,s2))). % 13.19/2.11 cnf(i_0_16, plain, (incident(b3,b2b3))). % 13.19/2.11 cnf(i_0_17, plain, (incident(b3,b3b1))). % 13.19/2.11 cnf(i_0_27, plain, (incident(b3,s3))). % 13.19/2.11 cnf(i_0_19, plain, (incident(s,s1))). % 13.19/2.11 cnf(i_0_20, plain, (incident(s,s2))). % 13.19/2.11 cnf(i_0_21, plain, (incident(s,s3))). % 13.19/2.11 cnf(i_0_55, negated_conjecture, (~goal)). % 13.19/2.11 cnf(i_0_36, plain, (a2!=a1)). % 13.19/2.11 cnf(i_0_38, plain, (a3!=a1)). % 13.19/2.11 cnf(i_0_37, plain, (a3!=a2)). % 13.19/2.11 cnf(i_0_43, plain, (a2a3!=b2b3)). % 13.19/2.11 cnf(i_0_39, plain, (b2!=b1)). % 13.19/2.11 cnf(i_0_44, plain, (a3a1!=b3b1)). % 13.19/2.11 cnf(i_0_41, plain, (b3!=b1)). % 13.19/2.11 cnf(i_0_40, plain, (b3!=b2)). % 13.19/2.11 cnf(i_0_42, plain, (a1a2!=b1b2)). % 13.19/2.11 cnf(i_0_34, plain, (point(X1)|~incident(X1,X2))). % 13.19/2.11 cnf(i_0_35, plain, (line(X1)|~incident(X2,X1))). % 13.19/2.11 cnf(i_0_4, plain, (incident(b3,a1a2)|incident(a1,b2b3))). % 13.19/2.11 cnf(i_0_1, plain, (~incident(p3,X1)|~incident(p1,X1)|~incident(p2,X1))). % 13.19/2.11 cnf(i_0_2, plain, (~incident(a1,b2b3)|~incident(a2,b3b1)|~incident(a3,b1b2))). % 13.19/2.11 cnf(i_0_3, plain, (~incident(b1,a2a3)|~incident(b2,a3a1)|~incident(b3,a1a2))). % 13.19/2.11 cnf(i_0_5, plain, (incident(b1,a2a3)|incident(a2,b3b1))). % 13.19/2.11 cnf(i_0_6, plain, (incident(b2,a3a1)|incident(a3,b1b2))). % 13.19/2.11 cnf(i_0_51, plain, (incident(X1,esk1_2(X2,X1))|~point(X2)|~point(X1))). % 13.19/2.11 cnf(i_0_52, plain, (incident(X1,esk1_2(X1,X2))|~point(X2)|~point(X1))). % 13.19/2.11 cnf(i_0_53, plain, (incident(esk2_2(X1,X2),X2)|~line(X2)|~line(X1))). % 13.19/2.11 cnf(i_0_54, plain, (incident(esk2_2(X1,X2),X1)|~line(X2)|~line(X1))). % 13.19/2.11 cnf(i_0_50, plain, (X1=X2|X3=X4|~incident(X2,X4)|~incident(X2,X3)|~incident(X1,X4)|~incident(X1,X3))). % 13.19/2.11 cnf(i_0_94, plain, (X32=X32)). % 13.19/2.11 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 13.19/2.11 # Begin printing tableau % 13.19/2.11 # Found 8 steps % 13.19/2.11 cnf(i_0_29, plain, (incident(p3,b1b2)), inference(start_rule)). % 13.19/2.11 cnf(i_0_101, plain, (incident(p3,b1b2)), inference(extension_rule, [i_0_98])). % 13.19/2.11 cnf(i_0_221, plain, ($false), inference(closure_rule, [i_0_94])). % 13.19/2.11 cnf(i_0_220, plain, (incident(p3,b1b2)), inference(extension_rule, [i_0_34])). % 13.19/2.11 cnf(i_0_222, plain, ($false), inference(closure_rule, [i_0_94])). % 13.19/2.11 cnf(i_0_230, plain, (point(p3)), inference(extension_rule, [i_0_51])). % 13.19/2.11 cnf(i_0_84063, plain, (~point(p3)), inference(closure_rule, [i_0_230])). % 13.19/2.11 cnf(i_0_84061, plain, (incident(p3,esk1_2(p3,p3))), inference(etableau_closure_rule, [i_0_84061, ...])). % 13.19/2.11 # End printing tableau % 13.19/2.11 # SZS output end % 13.19/2.11 # Branches closed with saturation will be marked with an "s" % 13.80/2.12 # Child (21111) has found a proof. % 13.80/2.12 % 13.80/2.12 # Proof search is over... % 13.80/2.12 # Freeing feature tree %------------------------------------------------------------------------------