%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GEO082+1 : TPTP v8.1.0. Released v2.4.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 : Sat Jul 16 04:07:40 EDT 2022 % Result : Theorem 0.19s 0.45s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : GEO082+1 : TPTP v8.1.0. Released v2.4.0. % 0.10/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 : n029.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 21:36:28 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr % 0.13/0.38 # and selection function SelectMaxLComplexAvoidPosPred. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 46 Number of unprocessed: 46 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # 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 # 46 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 3 conjectures. % 0.13/0.38 # There are 3 start rule candidates: % 0.13/0.38 # Found 4 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 3 start rule tableaux created. % 0.13/0.38 # 42 extension rule candidate clauses % 0.13/0.38 # 4 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 3 % 0.13/0.38 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 14 tableaux to operate on % 0.19/0.45 # There were 1 total branch saturation attempts. % 0.19/0.45 # There were 0 of these attempts blocked. % 0.19/0.45 # There were 0 deferred branch saturation attempts. % 0.19/0.45 # There were 0 free duplicated saturations. % 0.19/0.45 # There were 1 total successful branch saturations. % 0.19/0.45 # There were 0 successful branch saturations in interreduction. % 0.19/0.45 # There were 0 successful branch saturations on the branch. % 0.19/0.45 # There were 1 successful branch saturations after the branch. % 0.19/0.45 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # Begin clausification derivation % 0.19/0.45 % 0.19/0.45 # End clausification derivation % 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.45 cnf(i_0_46, negated_conjecture, (part_of(esk14_0,esk15_0))). % 0.19/0.45 cnf(i_0_45, negated_conjecture, (part_of(esk15_0,esk14_0))). % 0.19/0.45 cnf(i_0_34, plain, (inner_point(esk8_1(X1),X1))). % 0.19/0.45 cnf(i_0_44, negated_conjecture, (esk14_0!=esk15_0)). % 0.19/0.45 cnf(i_0_19, plain, (~inner_point(X1,X2)|~end_point(X1,X2))). % 0.19/0.45 cnf(i_0_29, plain, (~closed(X1)|~end_point(X2,X1))). % 0.19/0.45 cnf(i_0_17, plain, (incident_c(X1,X2)|~end_point(X1,X2))). % 0.19/0.45 cnf(i_0_38, plain, (esk11_2(X1,X2)!=X2|~end_point(X2,X1))). % 0.19/0.45 cnf(i_0_20, plain, (incident_c(X1,X2)|~inner_point(X1,X2))). % 0.19/0.45 cnf(i_0_30, plain, (open(X1)|~end_point(X2,X1))). % 0.19/0.45 cnf(i_0_26, plain, (incident_c(X1,X2)|~meet(X1,X3,X2))). % 0.19/0.45 cnf(i_0_28, plain, (closed(X1)|end_point(esk6_1(X1),X1))). % 0.19/0.45 cnf(i_0_27, plain, (incident_c(X1,X2)|~meet(X1,X2,X3))). % 0.19/0.45 cnf(i_0_1, plain, (part_of(X1,X2)|~incident_c(esk1_2(X2,X1),X2))). % 0.19/0.45 cnf(i_0_32, plain, (X1=X2|open(X1)|~part_of(X1,X2))). % 0.19/0.45 cnf(i_0_31, plain, (end_point(esk7_1(X1),X1)|~open(X1))). % 0.19/0.45 cnf(i_0_18, plain, (inner_point(X1,X2)|end_point(X1,X2)|~incident_c(X1,X2))). % 0.19/0.45 cnf(i_0_2, plain, (incident_c(esk1_2(X1,X2),X2)|part_of(X2,X1))). % 0.19/0.45 cnf(i_0_3, plain, (incident_c(X1,X2)|~incident_c(X1,X3)|~part_of(X3,X2))). % 0.19/0.45 cnf(i_0_39, plain, (end_point(esk11_2(X1,X2),X1)|~end_point(X2,X1))). % 0.19/0.45 cnf(i_0_11, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk3_2(X1,X2),esk4_2(X1,X2)))). % 0.19/0.45 cnf(i_0_10, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk4_2(X1,X2),esk3_2(X1,X2)))). % 0.19/0.45 cnf(i_0_15, plain, (end_point(X1,X2)|part_of(esk3_2(X1,X2),X2)|~incident_c(X1,X2))). % 0.19/0.45 cnf(i_0_14, plain, (end_point(X1,X2)|part_of(esk4_2(X1,X2),X2)|~incident_c(X1,X2))). % 0.19/0.45 cnf(i_0_41, plain, (esk12_2(X1,X2)=sum(X1,X2)|~meet(X3,X1,X2))). % 0.19/0.45 cnf(i_0_7, plain, (incident_c(X1,sum(X2,X3))|~incident_c(X1,X3))). % 0.19/0.45 cnf(i_0_8, plain, (incident_c(X1,sum(X2,X3))|~incident_c(X1,X2))). % 0.19/0.45 cnf(i_0_43, plain, (X1=X2|~incident_c(esk13_2(X1,X2),X2)|~incident_c(esk13_2(X1,X2),X1))). % 0.19/0.45 cnf(i_0_24, plain, (end_point(X1,X2)|~meet(X3,X4,X2)|~incident_c(X1,X4)|~incident_c(X1,X2))). % 0.19/0.45 cnf(i_0_25, plain, (end_point(X1,X2)|~meet(X3,X2,X4)|~incident_c(X1,X4)|~incident_c(X1,X2))). % 0.19/0.45 cnf(i_0_13, plain, (end_point(X1,X2)|incident_c(X1,esk3_2(X1,X2))|~incident_c(X1,X2))). % 0.19/0.45 cnf(i_0_12, plain, (end_point(X1,X2)|incident_c(X1,esk4_2(X1,X2))|~incident_c(X1,X2))). % 0.19/0.45 cnf(i_0_35, plain, (sum(esk9_2(X1,X2),esk10_2(X1,X2))=X1|~inner_point(X2,X1))). % 0.19/0.45 cnf(i_0_36, plain, (meet(X1,esk9_2(X2,X1),esk10_2(X2,X1))|~inner_point(X1,X2))). % 0.19/0.45 cnf(i_0_5, plain, (X1=sum(X2,X3)|~incident_c(esk2_3(X1,X2,X3),X3)|~incident_c(esk2_3(X1,X2,X3),X1))). % 0.19/0.45 cnf(i_0_6, plain, (X1=sum(X2,X3)|~incident_c(esk2_3(X1,X2,X3),X2)|~incident_c(esk2_3(X1,X2,X3),X1))). % 0.19/0.45 cnf(i_0_37, plain, (X1=X2|X1=X3|X2=X3|~end_point(X3,X4)|~end_point(X2,X4)|~end_point(X1,X4))). % 0.19/0.45 cnf(i_0_42, plain, (X1=X2|incident_c(esk13_2(X1,X2),X1)|incident_c(esk13_2(X1,X2),X2))). % 0.19/0.45 cnf(i_0_9, plain, (incident_c(X1,X2)|incident_c(X1,X3)|~incident_c(X1,sum(X3,X2)))). % 0.19/0.45 cnf(i_0_40, plain, (meet(X1,X2,X3)|~closed(sum(X2,X3))|~meet(X4,X2,X3)|~end_point(X1,X2))). % 0.19/0.45 cnf(i_0_22, plain, (meet(X1,X2,X3)|incident_c(esk5_3(X1,X2,X3),X3)|~incident_c(X1,X3)|~incident_c(X1,X2))). % 0.19/0.45 cnf(i_0_23, plain, (meet(X1,X2,X3)|incident_c(esk5_3(X1,X2,X3),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))). % 0.19/0.45 cnf(i_0_16, plain, (part_of(X1,X2)|part_of(X2,X1)|~end_point(X3,X4)|~incident_c(X3,X2)|~incident_c(X3,X1)|~part_of(X2,X4)|~part_of(X1,X4))). % 0.19/0.45 cnf(i_0_21, plain, (meet(X1,X2,X3)|~end_point(esk5_3(X1,X2,X3),X3)|~end_point(esk5_3(X1,X2,X3),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))). % 0.19/0.45 cnf(i_0_4, plain, (X1=sum(X2,X3)|incident_c(esk2_3(X1,X2,X3),X1)|incident_c(esk2_3(X1,X2,X3),X2)|incident_c(esk2_3(X1,X2,X3),X3))). % 0.19/0.45 cnf(i_0_33, plain, (part_of(X1,X2)|part_of(X1,X3)|part_of(X2,X1)|part_of(X2,X3)|part_of(X3,X1)|part_of(X3,X2)|~end_point(X4,X3)|~end_point(X4,X2)|~end_point(X4,X1)|~part_of(X3,X5)|~part_of(X2,X5)|~part_of(X1,X5))). % 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.45 # Begin printing tableau % 0.19/0.45 # Found 5 steps % 0.19/0.45 cnf(i_0_45, negated_conjecture, (part_of(esk15_0,esk14_0)), inference(start_rule)). % 0.19/0.45 cnf(i_0_52, plain, (part_of(esk15_0,esk14_0)), inference(extension_rule, [i_0_32])). % 0.19/0.45 cnf(i_0_206, plain, (esk14_0=esk15_0), inference(closure_rule, [i_0_44])). % 0.19/0.45 cnf(i_0_207, plain, (open(esk15_0)), inference(extension_rule, [i_0_31])). % 0.19/0.45 cnf(i_0_341, plain, (end_point(esk7_1(esk15_0),esk15_0)), inference(etableau_closure_rule, [i_0_341, ...])). % 0.19/0.45 # End printing tableau % 0.19/0.45 # SZS output end % 0.19/0.45 # Branches closed with saturation will be marked with an "s" % 0.19/0.46 # Child (12919) has found a proof. % 0.19/0.46 % 0.19/0.46 # Proof search is over... % 0.19/0.46 # Freeing feature tree %------------------------------------------------------------------------------