TSTP Solution File: LAT005-6 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LAT005-6 : TPTP v8.1.0. Released v1.1.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 : n003.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:26 EDT 2022
% Result : Unsatisfiable 5.09s 1.04s
% Output : CNFRefutation 5.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT005-6 : TPTP v8.1.0. Released v1.1.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.13/0.34 % Computer : n003.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 : Wed Jun 29 23:00:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.13/0.37 # and selection function SelectCQIPrecWNTNp.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 37 Number of unprocessed: 37
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 37 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 11 conjectures.
% 0.13/0.37 # There are 11 start rule candidates:
% 0.13/0.37 # Found 23 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 11 start rule tableaux created.
% 0.13/0.37 # 14 extension rule candidate clauses
% 0.13/0.37 # 23 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 5.09/1.04 # There were 1 total branch saturation attempts.
% 5.09/1.04 # There were 0 of these attempts blocked.
% 5.09/1.04 # There were 0 deferred branch saturation attempts.
% 5.09/1.04 # There were 0 free duplicated saturations.
% 5.09/1.04 # There were 1 total successful branch saturations.
% 5.09/1.04 # There were 0 successful branch saturations in interreduction.
% 5.09/1.04 # There were 0 successful branch saturations on the branch.
% 5.09/1.04 # There were 1 successful branch saturations after the branch.
% 5.09/1.04 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.09/1.04 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.09/1.04 # Begin clausification derivation
% 5.09/1.04
% 5.09/1.04 # End clausification derivation
% 5.09/1.04 # Begin listing active clauses obtained from FOF to CNF conversion
% 5.09/1.04 cnf(i_0_68, negated_conjecture, (join(a,b,c2))).
% 5.09/1.04 cnf(i_0_65, negated_conjecture, (join(c,r2,n1))).
% 5.09/1.04 cnf(i_0_69, negated_conjecture, (join(c2,r1,n1))).
% 5.09/1.04 cnf(i_0_72, negated_conjecture, (join(r1,e,a2))).
% 5.09/1.04 cnf(i_0_73, negated_conjecture, (join(r1,d,b2))).
% 5.09/1.04 cnf(i_0_64, negated_conjecture, (meet(a,b,c))).
% 5.09/1.04 cnf(i_0_39, plain, (join(X1,X1,X1))).
% 5.09/1.04 cnf(i_0_42, plain, (meet(X1,X1,X1))).
% 5.09/1.04 cnf(i_0_59, plain, (join(X1,n0,X1))).
% 5.09/1.04 cnf(i_0_61, plain, (meet(X1,n1,X1))).
% 5.09/1.04 cnf(i_0_66, negated_conjecture, (meet(c,r2,n0))).
% 5.09/1.04 cnf(i_0_71, negated_conjecture, (meet(r2,a,d))).
% 5.09/1.04 cnf(i_0_67, negated_conjecture, (meet(r2,b,e))).
% 5.09/1.04 cnf(i_0_70, negated_conjecture, (meet(c2,r1,n0))).
% 5.09/1.04 cnf(i_0_58, plain, (join(X1,n1,n1))).
% 5.09/1.04 cnf(i_0_60, plain, (meet(X1,n0,n0))).
% 5.09/1.04 cnf(i_0_38, plain, (join(n1,X1,n1))).
% 5.09/1.04 cnf(i_0_40, plain, (join(n0,X1,X1))).
% 5.09/1.04 cnf(i_0_43, plain, (meet(n1,X1,X1))).
% 5.09/1.04 cnf(i_0_41, plain, (meet(n0,X1,n0))).
% 5.09/1.04 cnf(i_0_56, plain, (join(X1,X2,join_of(X1,X2)))).
% 5.09/1.04 cnf(i_0_54, plain, (meet(X1,X2,meet_of(X1,X2)))).
% 5.09/1.04 cnf(i_0_74, negated_conjecture, (~meet(a2,b2,r1))).
% 5.09/1.04 cnf(i_0_45, plain, (join(X1,X2,X3)|~join(X2,X1,X3))).
% 5.09/1.04 cnf(i_0_46, plain, (join(X1,X2,X1)|~meet(X1,X3,X2))).
% 5.09/1.04 cnf(i_0_44, plain, (meet(X1,X2,X3)|~meet(X2,X1,X3))).
% 5.09/1.04 cnf(i_0_47, plain, (meet(X1,X2,X1)|~join(X1,X3,X2))).
% 5.09/1.04 cnf(i_0_57, plain, (X1=X2|~join(X3,X4,X2)|~join(X3,X4,X1))).
% 5.09/1.04 cnf(i_0_55, plain, (X1=X2|~meet(X3,X4,X2)|~meet(X3,X4,X1))).
% 5.09/1.04 cnf(i_0_50, plain, (join(X1,X2,X3)|~join(X4,X2,X5)|~join(X6,X5,X3)|~join(X6,X4,X1))).
% 5.09/1.04 cnf(i_0_51, plain, (join(X1,X2,X3)|~join(X4,X5,X3)|~join(X6,X5,X2)|~join(X1,X6,X4))).
% 5.09/1.04 cnf(i_0_48, plain, (meet(X1,X2,X3)|~meet(X4,X2,X5)|~meet(X6,X5,X3)|~meet(X6,X4,X1))).
% 5.09/1.04 cnf(i_0_49, plain, (meet(X1,X2,X3)|~meet(X4,X5,X3)|~meet(X6,X5,X2)|~meet(X1,X6,X4))).
% 5.09/1.04 cnf(i_0_62, plain, (join(X1,X2,X3)|~meet(X4,X5,X3)|~meet(X4,X6,X2)|~meet(X4,X1,X1)|~join(X6,X1,X5))).
% 5.09/1.04 cnf(i_0_52, plain, (join(X1,X2,X3)|~meet(X4,X5,X2)|~meet(X5,X6,X3)|~meet(X1,X5,X1)|~join(X1,X4,X6))).
% 5.09/1.04 cnf(i_0_53, plain, (meet(X1,X2,X3)|~meet(X4,X1,X5)|~meet(X6,X1,X6)|~join(X6,X5,X3)|~join(X6,X4,X2))).
% 5.09/1.04 cnf(i_0_63, plain, (meet(X1,X2,X3)|~meet(X1,X4,X5)|~meet(X1,X6,X6)|~join(X4,X6,X2)|~join(X6,X5,X3))).
% 5.09/1.04 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 5.09/1.04 # Begin printing tableau
% 5.09/1.04 # Found 7 steps
% 5.09/1.04 cnf(i_0_74, negated_conjecture, (~meet(a2,b2,r1)), inference(start_rule)).
% 5.09/1.04 cnf(i_0_75, plain, (~meet(a2,b2,r1)), inference(extension_rule, [i_0_44])).
% 5.09/1.04 cnf(i_0_91, plain, (~meet(b2,a2,r1)), inference(extension_rule, [i_0_48])).
% 5.09/1.04 cnf(i_0_113, plain, (~meet(a2,a2,a2)), inference(closure_rule, [i_0_42])).
% 5.09/1.04 cnf(i_0_114, plain, (~meet(r1,a2,r1)), inference(extension_rule, [i_0_47])).
% 5.09/1.04 cnf(i_0_121, plain, (~join(r1,e,a2)), inference(closure_rule, [i_0_72])).
% 5.09/1.04 cnf(i_0_115, plain, (~meet(r1,a2,b2)), inference(etableau_closure_rule, [i_0_115, ...])).
% 5.09/1.04 # End printing tableau
% 5.09/1.04 # SZS output end
% 5.09/1.04 # Branches closed with saturation will be marked with an "s"
% 5.09/1.04 # Child (5950) has found a proof.
% 5.09/1.04
% 5.09/1.04 # Proof search is over...
% 5.09/1.04 # Freeing feature tree
%------------------------------------------------------------------------------