TSTP Solution File: LAT011-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT011-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.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08 % Problem : LAT011-1 : TPTP v8.1.0. Released v2.2.0.
% 0.05/0.08 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Tue Jun 28 23:04:57 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.08/0.29 # No SInE strategy applied
% 0.08/0.29 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.08/0.29 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.08/0.29 #
% 0.08/0.29 # Presaturation interreduction done
% 0.08/0.29 # Number of axioms: 14 Number of unprocessed: 14
% 0.08/0.29 # Tableaux proof search.
% 0.08/0.29 # APR header successfully linked.
% 0.08/0.29 # Hello from C++
% 0.08/0.30 # The folding up rule is enabled...
% 0.08/0.30 # Local unification is enabled...
% 0.08/0.30 # Any saturation attempts will use folding labels...
% 0.08/0.30 # 14 beginning clauses after preprocessing and clausification
% 0.08/0.30 # Creating start rules for all 1 conjectures.
% 0.08/0.30 # There are 1 start rule candidates:
% 0.08/0.30 # Found 14 unit axioms.
% 0.08/0.30 # 1 start rule tableaux created.
% 0.08/0.30 # 0 extension rule candidate clauses
% 0.08/0.30 # 14 unit axiom clauses
% 0.08/0.30
% 0.08/0.30 # Requested 8, 32 cores available to the main process.
% 0.08/0.30 # There are not enough tableaux to fork, creating more from the initial 1
% 0.08/0.30 # Creating equality axioms
% 0.08/0.30 # Ran out of tableaux, making start rules for all clauses
% 0.08/0.30 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux.
% 0.08/0.30 # We now have 21 tableaux to operate on
% 0.12/0.42 # There were 1 total branch saturation attempts.
% 0.12/0.42 # There were 0 of these attempts blocked.
% 0.12/0.42 # There were 0 deferred branch saturation attempts.
% 0.12/0.42 # There were 0 free duplicated saturations.
% 0.12/0.42 # There were 1 total successful branch saturations.
% 0.12/0.42 # There were 0 successful branch saturations in interreduction.
% 0.12/0.42 # There were 0 successful branch saturations on the branch.
% 0.12/0.42 # There were 1 successful branch saturations after the branch.
% 0.12/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.42 # Begin clausification derivation
% 0.12/0.42
% 0.12/0.42 # End clausification derivation
% 0.12/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.42 cnf(i_0_15, plain, (meet(X1,X1)=X1)).
% 0.12/0.42 cnf(i_0_23, plain, (meet2(X1,X1)=X1)).
% 0.12/0.42 cnf(i_0_16, plain, (join(X1,X1)=X1)).
% 0.12/0.42 cnf(i_0_17, plain, (meet(X1,join(X1,X2))=X1)).
% 0.12/0.42 cnf(i_0_18, plain, (join(X1,meet(X1,X2))=X1)).
% 0.12/0.42 cnf(i_0_26, plain, (join(X1,meet2(X1,X2))=X1)).
% 0.12/0.42 cnf(i_0_25, plain, (meet2(X1,join(X1,X2))=X1)).
% 0.12/0.42 cnf(i_0_21, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))).
% 0.12/0.42 cnf(i_0_27, plain, (meet2(meet2(X1,X2),X3)=meet2(X1,meet2(X2,X3)))).
% 0.12/0.42 cnf(i_0_22, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 0.12/0.42 cnf(i_0_19, plain, (meet(X1,X2)=meet(X2,X1))).
% 0.12/0.42 cnf(i_0_20, plain, (join(X1,X2)=join(X2,X1))).
% 0.12/0.42 cnf(i_0_24, plain, (meet2(X1,X2)=meet2(X2,X1))).
% 0.12/0.42 cnf(i_0_28, negated_conjecture, (meet(a,b)!=meet2(a,b))).
% 0.12/0.42 cnf(i_0_30, plain, (X4=X4)).
% 0.12/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.42 # Begin printing tableau
% 0.12/0.42 # Found 6 steps
% 0.12/0.42 cnf(i_0_15, plain, (meet(meet2(a,b),meet2(a,b))=meet2(a,b)), inference(start_rule)).
% 0.12/0.42 cnf(i_0_37, plain, (meet(meet2(a,b),meet2(a,b))=meet2(a,b)), inference(extension_rule, [i_0_33])).
% 0.12/0.42 cnf(i_0_56, plain, (meet(a,b)=meet2(a,b)), inference(closure_rule, [i_0_28])).
% 0.12/0.42 cnf(i_0_57, plain, (meet(a,b)!=meet(meet2(a,b),meet2(a,b))), inference(extension_rule, [i_0_33])).
% 0.12/0.42 cnf(i_0_73, plain, (meet(a,b)!=meet(meet(a,b),meet(a,b))), inference(closure_rule, [i_0_15])).
% 0.12/0.42 cnf(i_0_74, plain, (meet(meet(a,b),meet(a,b))!=meet(meet2(a,b),meet2(a,b))), inference(etableau_closure_rule, [i_0_74, ...])).
% 0.12/0.42 # End printing tableau
% 0.12/0.42 # SZS output end
% 0.12/0.42 # Branches closed with saturation will be marked with an "s"
% 0.12/0.42 # Child (14416) has found a proof.
% 0.12/0.42
% 0.12/0.42 # Proof search is over...
% 0.12/0.42 # Freeing feature tree
%------------------------------------------------------------------------------