TSTP Solution File: LAT012-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT012-1 : TPTP v8.1.0. Released v2.2.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 : Sun Jul 17 04:48:28 EDT 2022
% Result : Unsatisfiable 0.15s 0.34s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LAT012-1 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Wed Jun 29 13:30:13 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.15/0.33 # No SInE strategy applied
% 0.15/0.33 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.15/0.33 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.15/0.33 #
% 0.15/0.33 # Number of axioms: 5 Number of unprocessed: 5
% 0.15/0.33 # Tableaux proof search.
% 0.15/0.33 # APR header successfully linked.
% 0.15/0.33 # Hello from C++
% 0.15/0.33 # The folding up rule is enabled...
% 0.15/0.33 # Local unification is enabled...
% 0.15/0.33 # Any saturation attempts will use folding labels...
% 0.15/0.33 # 5 beginning clauses after preprocessing and clausification
% 0.15/0.33 # Creating start rules for all 1 conjectures.
% 0.15/0.33 # There are 1 start rule candidates:
% 0.15/0.33 # Found 5 unit axioms.
% 0.15/0.33 # 1 start rule tableaux created.
% 0.15/0.33 # 0 extension rule candidate clauses
% 0.15/0.33 # 5 unit axiom clauses
% 0.15/0.33
% 0.15/0.33 # Requested 8, 32 cores available to the main process.
% 0.15/0.33 # There are not enough tableaux to fork, creating more from the initial 1
% 0.15/0.33 # Creating equality axioms
% 0.15/0.33 # Ran out of tableaux, making start rules for all clauses
% 0.15/0.33 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.15/0.33 # We now have 8 tableaux to operate on
% 0.15/0.34 # There were 3 total branch saturation attempts.
% 0.15/0.34 # There were 0 of these attempts blocked.
% 0.15/0.34 # There were 0 deferred branch saturation attempts.
% 0.15/0.34 # There were 1 free duplicated saturations.
% 0.15/0.34 # There were 3 total successful branch saturations.
% 0.15/0.34 # There were 0 successful branch saturations in interreduction.
% 0.15/0.34 # There were 0 successful branch saturations on the branch.
% 0.15/0.34 # There were 2 successful branch saturations after the branch.
% 0.15/0.34 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.34 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.34 # Begin clausification derivation
% 0.15/0.34
% 0.15/0.34 # End clausification derivation
% 0.15/0.34 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.34 cnf(i_0_10, negated_conjecture, (meet(b,a)!=meet(a,b))).
% 0.15/0.34 cnf(i_0_7, plain, (meet(X1,join(X2,join(X1,X3)))=X1)).
% 0.15/0.34 cnf(i_0_6, plain, (join(X1,meet(X2,meet(X1,X3)))=X1)).
% 0.15/0.34 cnf(i_0_9, plain, (meet(meet(join(X1,X2),join(X2,X3)),X2)=X2)).
% 0.15/0.34 cnf(i_0_8, plain, (join(join(meet(X1,X2),meet(X2,X3)),X2)=X2)).
% 0.15/0.34 cnf(i_0_12, plain, (X4=X4)).
% 0.15/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.34 # Begin printing tableau
% 0.15/0.34 # Found 6 steps
% 0.15/0.34 cnf(i_0_6, plain, (join(meet(a,b),meet(X2,meet(meet(a,b),X3)))=meet(a,b)), inference(start_rule)).
% 0.15/0.34 cnf(i_0_20, plain, (join(meet(a,b),meet(X2,meet(meet(a,b),X3)))=meet(a,b)), inference(extension_rule, [i_0_15])).
% 0.15/0.34 cnf(i_0_997, plain, (meet(b,a)=meet(a,b)), inference(closure_rule, [i_0_10])).
% 0.15/0.34 cnf(i_0_998, plain, (meet(b,a)!=join(meet(a,b),meet(X2,meet(meet(a,b),X3)))), inference(extension_rule, [i_0_15])).
% 0.15/0.34 cnf(i_0_1011, plain, (meet(b,a)!=meet(meet(b,a),join(X2,join(meet(b,a),X3)))), inference(closure_rule, [i_0_7])).
% 0.15/0.34 cnf(i_0_1012, plain, (meet(meet(b,a),join(X2,join(meet(b,a),X3)))!=join(meet(a,b),meet(X2,meet(meet(a,b),X3)))), inference(etableau_closure_rule, [i_0_1012, ...])).
% 0.15/0.34 # End printing tableau
% 0.15/0.34 # SZS output end
% 0.15/0.34 # Branches closed with saturation will be marked with an "s"
% 0.15/0.34 # Child (23666) has found a proof.
% 0.15/0.34
% 0.15/0.34 # Proof search is over...
% 0.15/0.34 # Freeing feature tree
%------------------------------------------------------------------------------