TSTP Solution File: LAT037-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT037-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 : n005.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:36 EDT 2022
% Result : Unsatisfiable 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT037-1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 30 13:07:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 20 Number of unprocessed: 20
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 20 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 1 conjectures.
% 0.19/0.37 # There are 1 start rule candidates:
% 0.19/0.37 # Found 19 unit axioms.
% 0.19/0.37 # 1 start rule tableaux created.
% 0.19/0.37 # 1 extension rule candidate clauses
% 0.19/0.37 # 19 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.37 # Creating equality axioms
% 0.19/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.37 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 26 tableaux to operate on
% 0.19/0.51 # There were 2 total branch saturation attempts.
% 0.19/0.51 # There were 0 of these attempts blocked.
% 0.19/0.51 # There were 0 deferred branch saturation attempts.
% 0.19/0.51 # There were 0 free duplicated saturations.
% 0.19/0.51 # There were 2 total successful branch saturations.
% 0.19/0.51 # There were 0 successful branch saturations in interreduction.
% 0.19/0.51 # There were 0 successful branch saturations on the branch.
% 0.19/0.51 # There were 2 successful branch saturations after the branch.
% 0.19/0.51 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.51 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.51 # Begin clausification derivation
% 0.19/0.51
% 0.19/0.51 # End clausification derivation
% 0.19/0.51 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.51 cnf(i_0_38, plain, (meet(xx,yy)=n0)).
% 0.19/0.51 cnf(i_0_39, plain, (meet(xx,zz)=n0)).
% 0.19/0.51 cnf(i_0_36, plain, (join(xx,yy)=n1)).
% 0.19/0.51 cnf(i_0_37, plain, (join(xx,zz)=n1)).
% 0.19/0.51 cnf(i_0_31, plain, (meet(X1,n0)=n0)).
% 0.19/0.51 cnf(i_0_34, plain, (join(X1,n1)=n1)).
% 0.19/0.51 cnf(i_0_21, plain, (meet(X1,X1)=X1)).
% 0.19/0.51 cnf(i_0_22, plain, (join(X1,X1)=X1)).
% 0.19/0.51 cnf(i_0_33, plain, (meet(X1,n1)=X1)).
% 0.19/0.51 cnf(i_0_32, plain, (join(X1,n0)=X1)).
% 0.19/0.51 cnf(i_0_23, plain, (meet(X1,join(X1,X2))=X1)).
% 0.19/0.51 cnf(i_0_24, plain, (join(X1,meet(X1,X2))=X1)).
% 0.19/0.51 cnf(i_0_27, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))).
% 0.19/0.51 cnf(i_0_28, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 0.19/0.51 cnf(i_0_30, hypothesis, (join(meet(X1,X2),meet(X1,X3))=meet(X1,join(X2,X3)))).
% 0.19/0.51 cnf(i_0_29, hypothesis, (meet(join(X1,X2),join(X1,X3))=join(X1,meet(X2,X3)))).
% 0.19/0.51 cnf(i_0_25, plain, (meet(X1,X2)=meet(X2,X1))).
% 0.19/0.51 cnf(i_0_26, plain, (join(X1,X2)=join(X2,X1))).
% 0.19/0.51 cnf(i_0_40, negated_conjecture, (zz!=yy)).
% 0.19/0.51 cnf(i_0_35, plain, (join(X1,meet(X2,X3))=meet(X3,join(X1,X2))|meet(X1,X3)!=X1)).
% 0.19/0.51 cnf(i_0_44, plain, (X4=X4)).
% 0.19/0.51 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.51 # Begin printing tableau
% 0.19/0.51 # Found 7 steps
% 0.19/0.51 cnf(i_0_38, plain, (meet(xx,yy)=n0), inference(start_rule)).
% 0.19/0.51 cnf(i_0_50, plain, (meet(xx,yy)=n0), inference(extension_rule, [i_0_47])).
% 0.19/0.51 cnf(i_0_80, plain, (meet(xx,yy)!=n0), inference(closure_rule, [i_0_38])).
% 0.19/0.51 cnf(i_0_78, plain, (meet(xx,yy)=meet(xx,yy)), inference(extension_rule, [i_0_47])).
% 0.19/0.51 cnf(i_0_93, plain, (meet(xx,yy)=xx), inference(extension_rule, [i_0_35])).
% 0.19/0.51 cnf(i_0_95, plain, (meet(xx,yy)!=xx), inference(etableau_closure_rule, [i_0_95, ...])).
% 0.19/0.51 cnf(i_0_96, plain, (join(xx,meet(X5,yy))=meet(yy,join(xx,X5))), inference(etableau_closure_rule, [i_0_96, ...])).
% 0.19/0.51 # End printing tableau
% 0.19/0.51 # SZS output end
% 0.19/0.51 # Branches closed with saturation will be marked with an "s"
% 0.19/0.51 # Child (8484) has found a proof.
% 0.19/0.51
% 0.19/0.51 # Proof search is over...
% 0.19/0.51 # Freeing feature tree
%------------------------------------------------------------------------------