TSTP Solution File: GEO086-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO086-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 : n011.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:42 EDT 2022
% Result : Unsatisfiable 0.21s 0.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO086-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.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 17 23:07:22 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.21/0.39 # No SInE strategy applied
% 0.21/0.39 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr
% 0.21/0.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.21/0.39 #
% 0.21/0.39 # Presaturation interreduction done
% 0.21/0.39 # Number of axioms: 46 Number of unprocessed: 46
% 0.21/0.39 # Tableaux proof search.
% 0.21/0.39 # APR header successfully linked.
% 0.21/0.39 # Hello from C++
% 0.21/0.39 # The folding up rule is enabled...
% 0.21/0.39 # Local unification is enabled...
% 0.21/0.39 # Any saturation attempts will use folding labels...
% 0.21/0.39 # 46 beginning clauses after preprocessing and clausification
% 0.21/0.39 # Creating start rules for all 3 conjectures.
% 0.21/0.39 # There are 3 start rule candidates:
% 0.21/0.39 # Found 4 unit axioms.
% 0.21/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.39 # 3 start rule tableaux created.
% 0.21/0.39 # 42 extension rule candidate clauses
% 0.21/0.39 # 4 unit axiom clauses
% 0.21/0.39
% 0.21/0.39 # Requested 8, 32 cores available to the main process.
% 0.21/0.39 # There are not enough tableaux to fork, creating more from the initial 3
% 0.21/0.39 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.39 # We now have 10 tableaux to operate on
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_100, negated_conjecture, (open(sk14))).
% 0.21/0.39 cnf(i_0_101, negated_conjecture, (part_of(sk15,sk14))).
% 0.21/0.39 cnf(i_0_88, plain, (inner_point(ax0_sk8(X1),X1))).
% 0.21/0.39 cnf(i_0_102, negated_conjecture, (~open(sk15))).
% 0.21/0.39 cnf(i_0_85, plain, (open(X1)|~end_point(X2,X1))).
% 0.21/0.39 cnf(i_0_73, plain, (~inner_point(X1,X2)|~end_point(X1,X2))).
% 0.21/0.39 cnf(i_0_84, plain, (end_point(ax0_sk7(X1),X1)|~open(X1))).
% 0.21/0.39 cnf(i_0_82, plain, (~closed(X1)|~end_point(X2,X1))).
% 0.21/0.39 cnf(i_0_93, plain, (ax0_sk11(X1,X2)!=X1|~end_point(X1,X2))).
% 0.21/0.39 cnf(i_0_64, plain, (incident_c(X1,X2)|~end_point(X1,X2))).
% 0.21/0.39 cnf(i_0_72, plain, (incident_c(X1,X2)|~inner_point(X1,X2))).
% 0.21/0.39 cnf(i_0_83, plain, (closed(X1)|end_point(ax0_sk6(X1),X1))).
% 0.21/0.39 cnf(i_0_86, plain, (X1=X2|open(X1)|~part_of(X1,X2))).
% 0.21/0.39 cnf(i_0_76, plain, (incident_c(X1,X2)|~meet(X1,X3,X2))).
% 0.21/0.39 cnf(i_0_75, plain, (incident_c(X1,X2)|~meet(X1,X2,X3))).
% 0.21/0.39 cnf(i_0_54, plain, (part_of(X1,X2)|~incident_c(ax0_sk1(X1,X2),X2))).
% 0.21/0.39 cnf(i_0_74, plain, (inner_point(X1,X2)|end_point(X1,X2)|~incident_c(X1,X2))).
% 0.21/0.39 cnf(i_0_53, plain, (incident_c(ax0_sk1(X1,X2),X1)|part_of(X1,X2))).
% 0.21/0.39 cnf(i_0_52, plain, (incident_c(X1,X2)|~incident_c(X1,X3)|~part_of(X3,X2))).
% 0.21/0.39 cnf(i_0_92, plain, (end_point(ax0_sk11(X1,X2),X2)|~end_point(X1,X2))).
% 0.21/0.39 cnf(i_0_70, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(ax0_sk3(X2,X1),ax0_sk4(X2,X1)))).
% 0.21/0.39 cnf(i_0_71, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(ax0_sk4(X2,X1),ax0_sk3(X2,X1)))).
% 0.21/0.39 cnf(i_0_66, plain, (end_point(X1,X2)|part_of(ax0_sk3(X2,X1),X2)|~incident_c(X1,X2))).
% 0.21/0.39 cnf(i_0_67, plain, (end_point(X1,X2)|part_of(ax0_sk4(X2,X1),X2)|~incident_c(X1,X2))).
% 0.21/0.39 cnf(i_0_95, plain, (ax0_sk12(X1,X2)=sum(X2,X1)|~meet(X3,X2,X1))).
% 0.21/0.39 cnf(i_0_57, plain, (incident_c(X1,sum(X2,X3))|~incident_c(X1,X3))).
% 0.21/0.39 cnf(i_0_56, plain, (incident_c(X1,sum(X2,X3))|~incident_c(X1,X2))).
% 0.21/0.39 cnf(i_0_99, plain, (X1=X2|~incident_c(ax0_sk13(X1,X2),X2)|~incident_c(ax0_sk13(X1,X2),X1))).
% 0.21/0.39 cnf(i_0_78, plain, (end_point(X1,X2)|~meet(X3,X4,X2)|~incident_c(X1,X2)|~incident_c(X1,X4))).
% 0.21/0.39 cnf(i_0_77, plain, (end_point(X1,X2)|~meet(X3,X2,X4)|~incident_c(X1,X4)|~incident_c(X1,X2))).
% 0.21/0.39 cnf(i_0_68, plain, (end_point(X1,X2)|incident_c(X1,ax0_sk3(X2,X1))|~incident_c(X1,X2))).
% 0.21/0.39 cnf(i_0_69, plain, (end_point(X1,X2)|incident_c(X1,ax0_sk4(X2,X1))|~incident_c(X1,X2))).
% 0.21/0.39 cnf(i_0_90, plain, (sum(ax0_sk9(X1,X2),ax0_sk10(X1,X2))=X2|~inner_point(X1,X2))).
% 0.21/0.39 cnf(i_0_89, plain, (meet(X1,ax0_sk9(X1,X2),ax0_sk10(X1,X2))|~inner_point(X1,X2))).
% 0.21/0.39 cnf(i_0_62, plain, (X1=sum(X2,X3)|~incident_c(ax0_sk2(X3,X2,X1),X1)|~incident_c(ax0_sk2(X3,X2,X1),X2))).
% 0.21/0.39 cnf(i_0_63, plain, (X1=sum(X2,X3)|~incident_c(ax0_sk2(X3,X2,X1),X1)|~incident_c(ax0_sk2(X3,X2,X1),X3))).
% 0.21/0.39 cnf(i_0_91, plain, (X1=X2|X1=X3|X2=X3|~end_point(X3,X4)|~end_point(X2,X4)|~end_point(X1,X4))).
% 0.21/0.39 cnf(i_0_96, plain, (X1=X2|incident_c(ax0_sk13(X1,X2),X1)|incident_c(ax0_sk13(X1,X2),X2))).
% 0.21/0.39 cnf(i_0_55, plain, (incident_c(X1,X2)|incident_c(X1,X3)|~incident_c(X1,sum(X3,X2)))).
% 0.21/0.39 cnf(i_0_94, plain, (meet(X1,X2,X3)|~closed(sum(X2,X3))|~meet(X4,X2,X3)|~end_point(X1,X2))).
% 0.21/0.39 cnf(i_0_80, plain, (meet(X1,X2,X3)|incident_c(ax0_sk5(X3,X2,X1),X3)|~incident_c(X1,X3)|~incident_c(X1,X2))).
% 0.21/0.39 cnf(i_0_79, plain, (meet(X1,X2,X3)|incident_c(ax0_sk5(X3,X2,X1),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))).
% 0.21/0.39 cnf(i_0_65, 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.21/0.39 cnf(i_0_81, plain, (meet(X1,X2,X3)|~end_point(ax0_sk5(X3,X2,X1),X3)|~end_point(ax0_sk5(X3,X2,X1),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))).
% 0.21/0.39 cnf(i_0_58, plain, (X1=sum(X2,X3)|incident_c(ax0_sk2(X3,X2,X1),X3)|incident_c(ax0_sk2(X3,X2,X1),X2)|incident_c(ax0_sk2(X3,X2,X1),X1))).
% 0.21/0.39 cnf(i_0_87, 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.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 4 steps
% 0.21/0.39 cnf(i_0_100, negated_conjecture, (open(sk14)), inference(start_rule)).
% 0.21/0.39 cnf(i_0_109, plain, (open(sk14)), inference(extension_rule, [i_0_84])).
% 0.21/0.39 cnf(i_0_378, plain, (end_point(ax0_sk7(sk14),sk14)), inference(extension_rule, [i_0_73])).
% 0.21/0.39 cnf(i_0_382, plain, (~inner_point(ax0_sk7(sk14),sk14)), inference(etableau_closure_rule, [i_0_382, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # Child (2975) has found a proof.
% 0.21/0.39
% 0.21/0.40 # Proof search is over...
% 0.21/0.40 # Freeing feature tree
%------------------------------------------------------------------------------