TSTP Solution File: GEO084+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO084+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 : n014.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:41 EDT 2022
% Result : Theorem 50.53s 6.71s
% Output : CNFRefutation 50.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO084+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 04:04:04 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.14/0.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.14/0.38 #
% 0.14/0.38 # Number of axioms: 47 Number of unprocessed: 47
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 47 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 4 conjectures.
% 0.14/0.38 # There are 4 start rule candidates:
% 0.14/0.38 # Found 5 unit axioms.
% 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.38 # 4 start rule tableaux created.
% 0.14/0.38 # 42 extension rule candidate clauses
% 0.14/0.38 # 5 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 4
% 0.14/0.38 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.38 # We now have 13 tableaux to operate on
% 50.53/6.71 # There were 5 total branch saturation attempts.
% 50.53/6.71 # There were 0 of these attempts blocked.
% 50.53/6.71 # There were 0 deferred branch saturation attempts.
% 50.53/6.71 # There were 0 free duplicated saturations.
% 50.53/6.71 # There were 3 total successful branch saturations.
% 50.53/6.71 # There were 0 successful branch saturations in interreduction.
% 50.53/6.71 # There were 0 successful branch saturations on the branch.
% 50.53/6.71 # There were 3 successful branch saturations after the branch.
% 50.53/6.71 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 50.53/6.71 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 50.53/6.71 # Begin clausification derivation
% 50.53/6.71
% 50.53/6.71 # End clausification derivation
% 50.53/6.71 # Begin listing active clauses obtained from FOF to CNF conversion
% 50.53/6.71 cnf(i_0_47, negated_conjecture, (part_of(esk14_0,esk16_0))).
% 50.53/6.71 cnf(i_0_46, negated_conjecture, (part_of(esk15_0,esk16_0))).
% 50.53/6.71 cnf(i_0_34, plain, (inner_point(esk8_1(X1),X1))).
% 50.53/6.71 cnf(i_0_28, plain, (closed(X1)|end_point(esk6_1(X1),X1))).
% 50.53/6.71 cnf(i_0_30, plain, (open(X2)|~end_point(X1,X2))).
% 50.53/6.71 cnf(i_0_31, plain, (end_point(esk7_1(X1),X1)|~open(X1))).
% 50.53/6.71 cnf(i_0_32, plain, (X1=X2|open(X1)|~part_of(X1,X2))).
% 50.53/6.71 cnf(i_0_29, plain, (~closed(X1)|~end_point(X2,X1))).
% 50.53/6.71 cnf(i_0_17, plain, (incident_c(X1,X2)|~end_point(X1,X2))).
% 50.53/6.71 cnf(i_0_20, plain, (incident_c(X1,X2)|~inner_point(X1,X2))).
% 50.53/6.71 cnf(i_0_19, plain, (~end_point(X1,X2)|~inner_point(X1,X2))).
% 50.53/6.71 cnf(i_0_38, plain, (esk11_2(X2,X1)!=X1|~end_point(X1,X2))).
% 50.53/6.71 cnf(i_0_45, negated_conjecture, (meet(esk17_0,esk14_0,esk15_0))).
% 50.53/6.71 cnf(i_0_44, negated_conjecture, (~part_of(sum(esk14_0,esk15_0),esk16_0))).
% 50.53/6.71 cnf(i_0_18, plain, (end_point(X1,X2)|inner_point(X1,X2)|~incident_c(X1,X2))).
% 50.53/6.71 cnf(i_0_2, plain, (part_of(X2,X1)|incident_c(esk1_2(X1,X2),X2))).
% 50.53/6.71 cnf(i_0_3, plain, (incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1))).
% 50.53/6.71 cnf(i_0_7, plain, (incident_c(X1,X3)|X3!=sum(X4,X2)|~incident_c(X1,X2))).
% 50.53/6.71 cnf(i_0_8, plain, (incident_c(X1,X3)|X3!=sum(X2,X4)|~incident_c(X1,X2))).
% 50.53/6.71 cnf(i_0_39, plain, (end_point(esk11_2(X1,X2),X1)|~end_point(X2,X1))).
% 50.53/6.71 cnf(i_0_37, plain, (X3=X4|X1=X4|X1=X3|~end_point(X4,X2)|~end_point(X3,X2)|~end_point(X1,X2))).
% 50.53/6.71 cnf(i_0_9, plain, (incident_c(X1,X4)|incident_c(X1,X3)|X2!=sum(X3,X4)|~incident_c(X1,X2))).
% 50.53/6.71 cnf(i_0_13, plain, (end_point(X1,X2)|incident_c(X1,esk3_2(X1,X2))|~incident_c(X1,X2))).
% 50.53/6.71 cnf(i_0_12, plain, (end_point(X1,X2)|incident_c(X1,esk4_2(X1,X2))|~incident_c(X1,X2))).
% 50.53/6.71 cnf(i_0_15, plain, (end_point(X1,X2)|part_of(esk3_2(X1,X2),X2)|~incident_c(X1,X2))).
% 50.53/6.71 cnf(i_0_14, plain, (end_point(X1,X2)|part_of(esk4_2(X1,X2),X2)|~incident_c(X1,X2))).
% 50.53/6.71 cnf(i_0_1, plain, (part_of(X2,X1)|~incident_c(esk1_2(X1,X2),X1))).
% 50.53/6.71 cnf(i_0_42, plain, (X1=X2|incident_c(esk13_2(X1,X2),X2)|incident_c(esk13_2(X1,X2),X1))).
% 50.53/6.71 cnf(i_0_35, plain, (sum(esk9_2(X1,X2),esk10_2(X1,X2))=X1|~inner_point(X2,X1))).
% 50.53/6.71 cnf(i_0_26, plain, (incident_c(X1,X2)|~meet(X1,X3,X2))).
% 50.53/6.71 cnf(i_0_27, plain, (incident_c(X1,X2)|~meet(X1,X2,X3))).
% 50.53/6.71 cnf(i_0_41, plain, (esk12_2(X2,X3)=sum(X2,X3)|~meet(X1,X2,X3))).
% 50.53/6.71 cnf(i_0_43, plain, (X1=X2|~incident_c(esk13_2(X1,X2),X2)|~incident_c(esk13_2(X1,X2),X1))).
% 50.53/6.71 cnf(i_0_36, plain, (meet(X1,esk9_2(X2,X1),esk10_2(X2,X1))|~inner_point(X1,X2))).
% 50.53/6.71 cnf(i_0_11, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk3_2(X1,X2),esk4_2(X1,X2)))).
% 50.53/6.71 cnf(i_0_10, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(esk4_2(X1,X2),esk3_2(X1,X2)))).
% 50.53/6.71 cnf(i_0_16, plain, (part_of(X3,X1)|part_of(X1,X3)|~part_of(X3,X2)|~part_of(X1,X2)|~incident_c(X4,X3)|~incident_c(X4,X1)|~end_point(X4,X2))).
% 50.53/6.71 cnf(i_0_24, plain, (end_point(X1,X2)|~incident_c(X1,X3)|~incident_c(X1,X2)|~meet(X4,X3,X2))).
% 50.53/6.71 cnf(i_0_25, plain, (end_point(X1,X2)|~incident_c(X1,X3)|~incident_c(X1,X2)|~meet(X4,X2,X3))).
% 50.53/6.71 cnf(i_0_40, plain, (meet(X5,X3,X4)|X1!=sum(X3,X4)|~closed(X1)|~end_point(X5,X3)|~meet(X2,X3,X4))).
% 50.53/6.71 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))).
% 50.53/6.71 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))).
% 50.53/6.71 cnf(i_0_33, plain, (part_of(X4,X3)|part_of(X4,X1)|part_of(X3,X4)|part_of(X3,X1)|part_of(X1,X4)|part_of(X1,X3)|~part_of(X4,X2)|~part_of(X3,X2)|~part_of(X1,X2)|~end_point(X5,X4)|~end_point(X5,X3)|~end_point(X5,X1))).
% 50.53/6.71 cnf(i_0_4, plain, (X1=sum(X2,X3)|incident_c(esk2_3(X1,X2,X3),X3)|incident_c(esk2_3(X1,X2,X3),X2)|incident_c(esk2_3(X1,X2,X3),X1))).
% 50.53/6.71 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))).
% 50.53/6.71 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))).
% 50.53/6.71 cnf(i_0_21, plain, (meet(X1,X2,X3)|~incident_c(X1,X3)|~incident_c(X1,X2)|~end_point(esk5_3(X1,X2,X3),X3)|~end_point(esk5_3(X1,X2,X3),X2))).
% 50.53/6.71 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 50.53/6.71 # Begin printing tableau
% 50.53/6.71 # Found 7 steps
% 50.53/6.71 cnf(i_0_45, negated_conjecture, (meet(esk17_0,esk14_0,esk15_0)), inference(start_rule)).
% 50.53/6.71 cnf(i_0_49, plain, (meet(esk17_0,esk14_0,esk15_0)), inference(extension_rule, [i_0_26])).
% 50.53/6.71 cnf(i_0_252, plain, (incident_c(esk17_0,esk15_0)), inference(extension_rule, [i_0_18])).
% 50.53/6.71 cnf(i_0_274, plain, (inner_point(esk17_0,esk15_0)), inference(extension_rule, [i_0_35])).
% 50.53/6.71 cnf(i_0_273, plain, (end_point(esk17_0,esk15_0)), inference(extension_rule, [i_0_29])).
% 50.53/6.71 cnf(i_0_400122, plain, (sum(esk9_2(esk15_0,esk17_0),esk10_2(esk15_0,esk17_0))=esk15_0), inference(etableau_closure_rule, [i_0_400122, ...])).
% 50.53/6.71 cnf(i_0_400131, plain, (~closed(esk15_0)), inference(etableau_closure_rule, [i_0_400131, ...])).
% 50.53/6.71 # End printing tableau
% 50.53/6.71 # SZS output end
% 50.53/6.71 # Branches closed with saturation will be marked with an "s"
% 50.53/6.72 # Child (23172) has found a proof.
% 50.53/6.72
% 50.53/6.72 # Proof search is over...
% 50.53/6.72 # Freeing feature tree
%------------------------------------------------------------------------------