TSTP Solution File: GEO093-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GEO093-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 : n032.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:45 EDT 2022
% Result : Unsatisfiable 2.64s 0.71s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GEO093-1 : TPTP v8.1.0. Released v2.4.0.
% 0.02/0.10 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Sat Jun 18 00:55:01 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.31 # No SInE strategy applied
% 0.14/0.31 # Auto-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.14/0.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.14/0.31 #
% 0.14/0.31 # Number of axioms: 48 Number of unprocessed: 48
% 0.14/0.31 # Tableaux proof search.
% 0.14/0.31 # APR header successfully linked.
% 0.14/0.31 # Hello from C++
% 0.14/0.31 # The folding up rule is enabled...
% 0.14/0.31 # Local unification is enabled...
% 0.14/0.31 # Any saturation attempts will use folding labels...
% 0.14/0.31 # 48 beginning clauses after preprocessing and clausification
% 0.14/0.31 # Creating start rules for all 5 conjectures.
% 0.14/0.31 # There are 5 start rule candidates:
% 0.14/0.31 # Found 6 unit axioms.
% 0.14/0.31 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.31 # 5 start rule tableaux created.
% 0.14/0.31 # 42 extension rule candidate clauses
% 0.14/0.31 # 6 unit axiom clauses
% 0.14/0.31
% 0.14/0.31 # Requested 8, 32 cores available to the main process.
% 0.14/0.31 # There are not enough tableaux to fork, creating more from the initial 5
% 0.14/0.31 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.31 # We now have 11 tableaux to operate on
% 2.64/0.71 # There were 5 total branch saturation attempts.
% 2.64/0.71 # There were 0 of these attempts blocked.
% 2.64/0.71 # There were 0 deferred branch saturation attempts.
% 2.64/0.71 # There were 0 free duplicated saturations.
% 2.64/0.71 # There were 5 total successful branch saturations.
% 2.64/0.71 # There were 1 successful branch saturations in interreduction.
% 2.64/0.71 # There were 0 successful branch saturations on the branch.
% 2.64/0.71 # There were 4 successful branch saturations after the branch.
% 2.64/0.71 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.64/0.71 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.64/0.71 # Begin clausification derivation
% 2.64/0.71
% 2.64/0.71 # End clausification derivation
% 2.64/0.71 # Begin listing active clauses obtained from FOF to CNF conversion
% 2.64/0.71 cnf(i_0_102, negated_conjecture, (open(sk14))).
% 2.64/0.71 cnf(i_0_103, negated_conjecture, (part_of(sk15,sk14))).
% 2.64/0.71 cnf(i_0_104, negated_conjecture, (part_of(sk16,sk14))).
% 2.64/0.71 cnf(i_0_90, plain, (inner_point(ax0_sk8(X1),X1))).
% 2.64/0.71 cnf(i_0_85, plain, (closed(X1)|end_point(ax0_sk6(X1),X1))).
% 2.64/0.71 cnf(i_0_87, plain, (open(X2)|~end_point(X1,X2))).
% 2.64/0.71 cnf(i_0_86, plain, (end_point(ax0_sk7(X1),X1)|~open(X1))).
% 2.64/0.71 cnf(i_0_88, plain, (X1=X2|open(X1)|~part_of(X1,X2))).
% 2.64/0.71 cnf(i_0_84, plain, (~closed(X1)|~end_point(X2,X1))).
% 2.64/0.71 cnf(i_0_66, plain, (incident_c(X1,X2)|~end_point(X1,X2))).
% 2.64/0.71 cnf(i_0_74, plain, (incident_c(X1,X2)|~inner_point(X1,X2))).
% 2.64/0.71 cnf(i_0_106, negated_conjecture, (~open(sum(sk15,sk16)))).
% 2.64/0.71 cnf(i_0_75, plain, (~end_point(X1,X2)|~inner_point(X1,X2))).
% 2.64/0.71 cnf(i_0_95, plain, (ax0_sk11(X1,X2)!=X1|~end_point(X1,X2))).
% 2.64/0.71 cnf(i_0_105, negated_conjecture, (meet(sk17,sk15,sk16))).
% 2.64/0.71 cnf(i_0_76, plain, (end_point(X1,X2)|inner_point(X1,X2)|~incident_c(X1,X2))).
% 2.64/0.71 cnf(i_0_55, plain, (part_of(X1,X2)|incident_c(ax0_sk1(X1,X2),X1))).
% 2.64/0.71 cnf(i_0_54, plain, (incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1))).
% 2.64/0.71 cnf(i_0_59, plain, (incident_c(X4,X1)|X1!=sum(X2,X3)|~incident_c(X4,X3))).
% 2.64/0.71 cnf(i_0_58, plain, (incident_c(X4,X1)|X1!=sum(X2,X3)|~incident_c(X4,X2))).
% 2.64/0.71 cnf(i_0_94, plain, (end_point(ax0_sk11(X1,X2),X2)|~end_point(X1,X2))).
% 2.64/0.71 cnf(i_0_93, plain, (X3=X4|X1=X4|X1=X3|~end_point(X4,X2)|~end_point(X3,X2)|~end_point(X1,X2))).
% 2.64/0.71 cnf(i_0_57, plain, (incident_c(X4,X3)|incident_c(X4,X2)|X1!=sum(X2,X3)|~incident_c(X4,X1))).
% 2.64/0.71 cnf(i_0_70, plain, (end_point(X1,X2)|incident_c(X1,ax0_sk3(X2,X1))|~incident_c(X1,X2))).
% 2.64/0.71 cnf(i_0_71, plain, (end_point(X1,X2)|incident_c(X1,ax0_sk4(X2,X1))|~incident_c(X1,X2))).
% 2.64/0.71 cnf(i_0_68, plain, (end_point(X1,X2)|part_of(ax0_sk3(X2,X1),X2)|~incident_c(X1,X2))).
% 2.64/0.71 cnf(i_0_69, plain, (end_point(X1,X2)|part_of(ax0_sk4(X2,X1),X2)|~incident_c(X1,X2))).
% 2.64/0.71 cnf(i_0_56, plain, (part_of(X1,X2)|~incident_c(ax0_sk1(X1,X2),X2))).
% 2.64/0.71 cnf(i_0_98, plain, (X1=X2|incident_c(ax0_sk13(X1,X2),X2)|incident_c(ax0_sk13(X1,X2),X1))).
% 2.64/0.71 cnf(i_0_92, plain, (sum(ax0_sk9(X1,X2),ax0_sk10(X1,X2))=X2|~inner_point(X1,X2))).
% 2.64/0.71 cnf(i_0_78, plain, (incident_c(X1,X3)|~meet(X1,X2,X3))).
% 2.64/0.71 cnf(i_0_77, plain, (incident_c(X1,X2)|~meet(X1,X2,X3))).
% 2.64/0.71 cnf(i_0_97, plain, (ax0_sk12(X3,X2)=sum(X2,X3)|~meet(X1,X2,X3))).
% 2.64/0.71 cnf(i_0_101, plain, (X1=X2|~incident_c(ax0_sk13(X1,X2),X2)|~incident_c(ax0_sk13(X1,X2),X1))).
% 2.64/0.71 cnf(i_0_91, plain, (meet(X1,ax0_sk9(X1,X2),ax0_sk10(X1,X2))|~inner_point(X1,X2))).
% 2.64/0.71 cnf(i_0_72, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(ax0_sk3(X2,X1),ax0_sk4(X2,X1)))).
% 2.64/0.71 cnf(i_0_73, plain, (end_point(X1,X2)|~incident_c(X1,X2)|~part_of(ax0_sk4(X2,X1),ax0_sk3(X2,X1)))).
% 2.64/0.71 cnf(i_0_67, plain, (part_of(X4,X3)|part_of(X3,X4)|~part_of(X4,X2)|~part_of(X3,X2)|~incident_c(X1,X4)|~incident_c(X1,X3)|~end_point(X1,X2))).
% 2.64/0.71 cnf(i_0_80, plain, (end_point(X4,X3)|~incident_c(X4,X3)|~incident_c(X4,X2)|~meet(X1,X2,X3))).
% 2.64/0.71 cnf(i_0_79, plain, (end_point(X4,X2)|~incident_c(X4,X3)|~incident_c(X4,X2)|~meet(X1,X2,X3))).
% 2.64/0.71 cnf(i_0_96, plain, (meet(X5,X3,X4)|X1!=sum(X3,X4)|~closed(X1)|~end_point(X5,X3)|~meet(X2,X3,X4))).
% 2.64/0.71 cnf(i_0_82, plain, (meet(X1,X2,X3)|incident_c(ax0_sk5(X3,X2,X1),X3)|~incident_c(X1,X3)|~incident_c(X1,X2))).
% 2.64/0.71 cnf(i_0_81, plain, (meet(X1,X2,X3)|incident_c(ax0_sk5(X3,X2,X1),X2)|~incident_c(X1,X3)|~incident_c(X1,X2))).
% 2.64/0.71 cnf(i_0_89, 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))).
% 2.64/0.71 cnf(i_0_60, plain, (X3=sum(X2,X1)|incident_c(ax0_sk2(X1,X2,X3),X3)|incident_c(ax0_sk2(X1,X2,X3),X2)|incident_c(ax0_sk2(X1,X2,X3),X1))).
% 2.64/0.71 cnf(i_0_64, plain, (X3=sum(X2,X1)|~incident_c(ax0_sk2(X1,X2,X3),X3)|~incident_c(ax0_sk2(X1,X2,X3),X2))).
% 2.64/0.71 cnf(i_0_65, plain, (X3=sum(X2,X1)|~incident_c(ax0_sk2(X1,X2,X3),X3)|~incident_c(ax0_sk2(X1,X2,X3),X1))).
% 2.64/0.71 cnf(i_0_83, plain, (meet(X1,X2,X3)|~incident_c(X1,X3)|~incident_c(X1,X2)|~end_point(ax0_sk5(X3,X2,X1),X3)|~end_point(ax0_sk5(X3,X2,X1),X2))).
% 2.64/0.71 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 2.64/0.71 # Begin printing tableau
% 2.64/0.71 # Found 12 steps
% 2.64/0.71 cnf(i_0_105, negated_conjecture, (meet(sk17,sk15,sk16)), inference(start_rule)).
% 2.64/0.71 cnf(i_0_107, plain, (meet(sk17,sk15,sk16)), inference(extension_rule, [i_0_96])).
% 2.64/0.71 cnf(i_0_208, plain, (meet(ax0_sk6(sk15),sk15,sk16)), inference(extension_rule, [i_0_78])).
% 2.64/0.71 cnf(i_0_448, plain, (incident_c(ax0_sk6(sk15),sk16)), inference(extension_rule, [i_0_76])).
% 2.64/0.71 cnf(i_0_209, plain, ($false), inference(extension_rule, [i_0_88])).
% 2.64/0.71 cnf(i_0_479, plain, (open(sum(sk15,sk16))), inference(closure_rule, [i_0_106])).
% 2.64/0.71 cnf(i_0_210, plain, (~closed(sum(sk15,sk16))), inference(etableau_closure_rule, [i_0_210, ...])).
% 2.64/0.71 cnf(i_0_480, plain, (~part_of(sum(sk15,sk16),sum(sk15,sk16))), inference(etableau_closure_rule, [i_0_480, ...])).
% 2.64/0.71 cnf(i_0_211, plain, (~end_point(ax0_sk6(sk15),sk15)), inference(extension_rule, [i_0_85])).
% 2.64/0.71 cnf(i_0_469, plain, (end_point(ax0_sk6(sk15),sk16)), inference(etableau_closure_rule, [i_0_469, ...])).
% 2.64/0.71 cnf(i_0_470, plain, (inner_point(ax0_sk6(sk15),sk16)), inference(etableau_closure_rule, [i_0_470, ...])).
% 2.64/0.71 cnf(i_0_590, plain, (closed(sk15)), inference(etableau_closure_rule, [i_0_590, ...])).
% 2.64/0.71 # End printing tableau
% 2.64/0.71 # SZS output end
% 2.64/0.71 # Branches closed with saturation will be marked with an "s"
% 2.64/0.72 # Child (6874) has found a proof.
% 2.64/0.72
% 2.64/0.72 # Proof search is over...
% 2.64/0.72 # Freeing feature tree
%------------------------------------------------------------------------------