TSTP Solution File: LCL414-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL414-1 : TPTP v8.1.0. Released v2.5.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 : n028.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 10:22:02 EDT 2022
% Result : Unsatisfiable 0.17s 0.36s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL414-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jul 2 20:58:02 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.35 # No SInE strategy applied
% 0.17/0.35 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 0.17/0.35 # and selection function PSelectComplexExceptRRHorn.
% 0.17/0.35 #
% 0.17/0.35 # Presaturation interreduction done
% 0.17/0.35 # Number of axioms: 5 Number of unprocessed: 5
% 0.17/0.35 # Tableaux proof search.
% 0.17/0.35 # APR header successfully linked.
% 0.17/0.35 # Hello from C++
% 0.17/0.35 # The folding up rule is enabled...
% 0.17/0.35 # Local unification is enabled...
% 0.17/0.35 # Any saturation attempts will use folding labels...
% 0.17/0.35 # 5 beginning clauses after preprocessing and clausification
% 0.17/0.35 # Creating start rules for all 5 conjectures.
% 0.17/0.35 # There are 5 start rule candidates:
% 0.17/0.35 # Found 4 unit axioms.
% 0.17/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.17/0.35 # 5 start rule tableaux created.
% 0.17/0.35 # 1 extension rule candidate clauses
% 0.17/0.35 # 4 unit axiom clauses
% 0.17/0.35
% 0.17/0.35 # Requested 8, 32 cores available to the main process.
% 0.17/0.35 # There are not enough tableaux to fork, creating more from the initial 5
% 0.17/0.35 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.17/0.35 # We now have 8 tableaux to operate on
% 0.17/0.36 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done.
% 0.17/0.36 # There were 0 total branch saturation attempts.
% 0.17/0.36 # There were 0 of these attempts blocked.
% 0.17/0.36 # There were 0 deferred branch saturation attempts.
% 0.17/0.36 # There were 0 free duplicated saturations.
% 0.17/0.36 # There were 0 total successful branch saturations.
% 0.17/0.36 # There were 0 successful branch saturations in interreduction.
% 0.17/0.36 # There were 0 successful branch saturations on the branch.
% 0.17/0.36 # There were 0 successful branch saturations after the branch.
% 0.17/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.36 # Begin clausification derivation
% 0.17/0.36
% 0.17/0.36 # End clausification derivation
% 0.17/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.17/0.36 cnf(i_0_7, negated_conjecture, (a_truth(implies(X1,implies(X2,X1))))).
% 0.17/0.36 cnf(i_0_9, negated_conjecture, (a_truth(implies(implies(not(X1),not(X2)),implies(X2,X1))))).
% 0.17/0.36 cnf(i_0_8, negated_conjecture, (a_truth(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))))).
% 0.17/0.36 cnf(i_0_10, negated_conjecture, (~a_truth(implies(sk1,sk1)))).
% 0.17/0.36 cnf(i_0_6, negated_conjecture, (a_truth(X1)|~a_truth(implies(X2,X1))|~a_truth(X2))).
% 0.17/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.17/0.36 # Begin printing tableau
% 0.17/0.36 # Found 6 steps
% 0.17/0.36 cnf(i_0_7, negated_conjecture, (a_truth(implies(sk1,implies(X7,sk1)))), inference(start_rule)).
% 0.17/0.36 cnf(i_0_17, plain, (a_truth(implies(sk1,implies(X7,sk1)))), inference(extension_rule, [i_0_6])).
% 0.17/0.36 cnf(i_0_30, plain, (a_truth(implies(sk1,sk1))), inference(closure_rule, [i_0_10])).
% 0.17/0.36 cnf(i_0_31, plain, (~a_truth(implies(implies(sk1,implies(X7,sk1)),implies(sk1,sk1)))), inference(extension_rule, [i_0_6])).
% 0.17/0.36 cnf(i_0_34, plain, (~a_truth(implies(implies(sk1,implies(implies(X7,sk1),sk1)),implies(implies(sk1,implies(X7,sk1)),implies(sk1,sk1))))), inference(closure_rule, [i_0_8])).
% 0.17/0.36 cnf(i_0_35, plain, (~a_truth(implies(sk1,implies(implies(X7,sk1),sk1)))), inference(closure_rule, [i_0_7])).
% 0.17/0.36 # End printing tableau
% 0.17/0.36 # SZS output end
% 0.17/0.36 # Branches closed with saturation will be marked with an "s"
% 0.17/0.36 # Child (7896) has found a proof.
% 0.17/0.36
% 0.17/0.36 # Proof search is over...
% 0.17/0.36 # Freeing feature tree
%------------------------------------------------------------------------------