TSTP Solution File: LAT395-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT395-1 : TPTP v8.1.0. Released v6.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 : n007.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:52:00 EDT 2022
% Result : Satisfiable 20.19s 2.97s
% Output : CNFRefutation 20.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT395-1 : TPTP v8.1.0. Released v6.4.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 28 21:28:22 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 20 Number of unprocessed: 20
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 20 beginning clauses after preprocessing and clausification
% 0.12/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.12/0.37 # No conjectures.
% 0.12/0.37 # There are 20 start rule candidates:
% 0.12/0.37 # Found 12 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 20 start rule tableaux created.
% 0.12/0.37 # 8 extension rule candidate clauses
% 0.12/0.37 # 12 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 20.19/2.97 # 17855 Satisfiable branch
% 20.19/2.97 # Satisfiable branch found.
% 20.19/2.97 # There were 2 total branch saturation attempts.
% 20.19/2.97 # There were 0 of these attempts blocked.
% 20.19/2.97 # There were 0 deferred branch saturation attempts.
% 20.19/2.97 # There were 0 free duplicated saturations.
% 20.19/2.97 # There were 0 total successful branch saturations.
% 20.19/2.97 # There were 0 successful branch saturations in interreduction.
% 20.19/2.97 # There were 0 successful branch saturations on the branch.
% 20.19/2.97 # There were 0 successful branch saturations after the branch.
% 20.19/2.97 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.19/2.97 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.19/2.97 # Begin clausification derivation
% 20.19/2.97
% 20.19/2.97 # End clausification derivation
% 20.19/2.97 # Begin listing active clauses obtained from FOF to CNF conversion
% 20.19/2.97 cnf(i_0_29, plain, (meet(X1,n0)=n0)).
% 20.19/2.97 cnf(i_0_32, plain, (join(X1,n1)=n1)).
% 20.19/2.97 cnf(i_0_31, plain, (meet(X1,n1)=X1)).
% 20.19/2.97 cnf(i_0_30, plain, (join(X1,n0)=X1)).
% 20.19/2.97 cnf(i_0_21, plain, (meet(X1,X1)=X1)).
% 20.19/2.97 cnf(i_0_22, plain, (join(X1,X1)=X1)).
% 20.19/2.97 cnf(i_0_23, plain, (meet(X1,join(X1,X2))=X1)).
% 20.19/2.97 cnf(i_0_24, plain, (join(X1,meet(X1,X2))=X1)).
% 20.19/2.97 cnf(i_0_27, plain, (meet(meet(X1,X2),X3)=meet(X1,meet(X2,X3)))).
% 20.19/2.97 cnf(i_0_28, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 20.19/2.97 cnf(i_0_25, plain, (meet(X1,X2)=meet(X2,X1))).
% 20.19/2.97 cnf(i_0_26, plain, (join(X1,X2)=join(X2,X1))).
% 20.19/2.97 cnf(i_0_37, plain, (complement(X1,X2)|~unique_complement(X1,X2))).
% 20.19/2.97 cnf(i_0_34, plain, (meet(X1,X2)=n0|~complement(X1,X2))).
% 20.19/2.97 cnf(i_0_35, plain, (join(X1,X2)=n1|~complement(X1,X2))).
% 20.19/2.97 cnf(i_0_40, plain, (unique_complement(X1,X2)|f(X1,X2)!=X2|~complement(X1,X2))).
% 20.19/2.97 cnf(i_0_38, plain, (X1=X2|~unique_complement(X3,X1)|~complement(X3,X2))).
% 20.19/2.97 cnf(i_0_36, plain, (complement(X1,X2)|meet(X1,X2)!=n0|join(X1,X2)!=n1)).
% 20.19/2.97 cnf(i_0_39, plain, (unique_complement(X1,X2)|complement(X1,f(X1,X2))|~complement(X1,X2))).
% 20.19/2.97 cnf(i_0_33, plain, (join(X1,meet(X2,X3))=meet(X3,join(X1,X2))|meet(X1,X3)!=X1)).
% 20.19/2.97 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 20.19/2.97 # Begin printing tableau
% 20.19/2.97 # Found 9 steps
% 20.19/2.97 cnf(i_0_22, plain, (join(n1,n1)=n1), inference(start_rule)).
% 20.19/2.97 cnf(i_0_46, plain, (join(n1,n1)=n1), inference(extension_rule, [i_0_36])).
% 20.19/2.97 cnf(i_0_85, plain, (complement(n1,n1)), inference(extension_rule, [i_0_40])).
% 20.19/2.97 cnf(i_0_94, plain, (unique_complement(n1,n1)), inference(extension_rule, [i_0_38])).
% 20.19/2.97 cnf(i_0_231525, plain, (~complement(n1,n1)), inference(closure_rule, [i_0_85])).
% 20.19/2.97 cnf(i_0_95, plain, (f(n1,n1)!=n1), inference(extension_rule, [i_0_38])).
% 20.19/2.97 cnf(i_0_231545, plain, (~complement(n1,n1)), inference(closure_rule, [i_0_85])).
% 20.19/2.97 cnf(i_0_86, plain, (meet(n1,n1)!=n0), inference(extension_rule, [i_0_38])).
% 20.19/2.97 cnf(i_0_231565, plain, (~complement(n1,n0)), inference(closure_rule, [i_0_38737])).
% 20.19/2.97 # End printing tableau
% 20.19/2.97 # SZS output end
% 20.19/2.97 # Branches closed with saturation will be marked with an "s"
% 20.19/2.98 # Child (17855) has found a proof.
% 20.19/2.98
% 20.19/2.98 # Proof search is over...
% 20.19/2.98 # Freeing feature tree
%------------------------------------------------------------------------------