TSTP Solution File: LCL114-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : LCL114-2 : TPTP v8.1.0. Released v1.0.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 : n015.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:19:43 EDT 2022
% Result : Unsatisfiable 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL114-2 : TPTP v8.1.0. Released v1.0.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.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 2 17:47:14 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.14/0.37 # and selection function SelectNewComplexAHP.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 5 Number of unprocessed: 5
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.37 # The folding up rule is enabled...
% 0.14/0.37 # Local unification is enabled...
% 0.14/0.37 # Any saturation attempts will use folding labels...
% 0.14/0.37 # 5 beginning clauses after preprocessing and clausification
% 0.14/0.37 # Creating start rules for all 1 conjectures.
% 0.14/0.37 # There are 1 start rule candidates:
% 0.14/0.37 # Found 5 unit axioms.
% 0.14/0.37 # 1 start rule tableaux created.
% 0.14/0.37 # 0 extension rule candidate clauses
% 0.14/0.37 # 5 unit axiom clauses
% 0.14/0.37
% 0.14/0.37 # Requested 8, 32 cores available to the main process.
% 0.14/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.37 # Creating equality axioms
% 0.14/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.37 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.37 # We now have 9 tableaux to operate on
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_6, plain, (implies(truth,X1)=X1)).
% 0.14/0.39 cnf(i_0_9, plain, (implies(implies(not(X1),not(X2)),implies(X2,X1))=truth)).
% 0.14/0.39 cnf(i_0_7, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)).
% 0.14/0.39 cnf(i_0_8, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))).
% 0.14/0.39 cnf(i_0_10, negated_conjecture, (implies(implies(x,y),implies(not(y),not(x)))!=truth)).
% 0.14/0.39 cnf(i_0_12, plain, (X4=X4)).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 5 steps
% 0.14/0.39 cnf(i_0_6, plain, (implies(truth,X3)=X3), inference(start_rule)).
% 0.14/0.39 cnf(i_0_18, plain, (implies(truth,X3)=X3), inference(extension_rule, [i_0_17])).
% 0.14/0.39 cnf(i_0_34, plain, (not(implies(truth,X3))=not(X3)), inference(extension_rule, [i_0_15])).
% 0.14/0.39 cnf(i_0_42, plain, (not(X3)!=implies(truth,not(X3))), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_40, plain, (not(implies(truth,X3))=implies(truth,not(X3))), inference(etableau_closure_rule, [i_0_40, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_6, plain, (implies(truth,X1)=X1)).
% 0.14/0.39 cnf(i_0_9, plain, (implies(implies(not(X1),not(X2)),implies(X2,X1))=truth)).
% 0.14/0.39 cnf(i_0_7, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)).
% 0.14/0.39 cnf(i_0_8, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))).
% 0.14/0.39 cnf(i_0_10, negated_conjecture, (implies(implies(x,y),implies(not(y),not(x)))!=truth)).
% 0.14/0.39 cnf(i_0_12, plain, (X4=X4)).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 6 steps
% 0.14/0.39 cnf(i_0_6, plain, (implies(truth,X7)=X7), inference(start_rule)).
% 0.14/0.39 cnf(i_0_18, plain, (implies(truth,X7)=X7), inference(extension_rule, [i_0_16])).
% 0.14/0.39 cnf(i_0_32, plain, (implies(truth,truth)!=truth), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_31, plain, (implies(implies(truth,truth),implies(truth,X7))=implies(truth,X7)), inference(extension_rule, [i_0_15])).
% 0.14/0.39 cnf(i_0_42, plain, (implies(truth,X7)!=X7), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_40, plain, (implies(implies(truth,truth),implies(truth,X7))=X7), inference(etableau_closure_rule, [i_0_40, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # There were 1 total branch saturation attempts.
% 0.14/0.39 # There were 0 of these attempts blocked.
% 0.14/0.39 # There were 0 deferred branch saturation attempts.
% 0.14/0.39 # There were 0 free duplicated saturations.
% 0.14/0.39 # There were 1 total successful branch saturations.
% 0.14/0.39 # There were 0 successful branch saturations in interreduction.
% 0.14/0.39 # There were 0 successful branch saturations on the branch.
% 0.14/0.39 # There were 1 successful branch saturations after the branch.
% 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 # Begin clausification derivation
% 0.14/0.39
% 0.14/0.39 # End clausification derivation
% 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.39 cnf(i_0_6, plain, (implies(truth,X1)=X1)).
% 0.14/0.39 cnf(i_0_9, plain, (implies(implies(not(X1),not(X2)),implies(X2,X1))=truth)).
% 0.14/0.39 cnf(i_0_7, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)).
% 0.14/0.39 cnf(i_0_8, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))).
% 0.14/0.39 cnf(i_0_10, negated_conjecture, (implies(implies(x,y),implies(not(y),not(x)))!=truth)).
% 0.14/0.39 cnf(i_0_12, plain, (X4=X4)).
% 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.39 # Begin printing tableau
% 0.14/0.39 # Found 6 steps
% 0.14/0.39 cnf(i_0_6, plain, (implies(truth,truth)=truth), inference(start_rule)).
% 0.14/0.39 cnf(i_0_18, plain, (implies(truth,truth)=truth), inference(extension_rule, [i_0_15])).
% 0.14/0.39 cnf(i_0_28, plain, (implies(implies(x,y),implies(not(y),not(x)))=truth), inference(closure_rule, [i_0_10])).
% 0.14/0.39 cnf(i_0_29, plain, (implies(implies(x,y),implies(not(y),not(x)))!=implies(truth,truth)), inference(extension_rule, [i_0_15])).
% 0.14/0.39 cnf(i_0_41, plain, (implies(implies(x,y),implies(not(y),not(x)))!=implies(truth,implies(implies(x,y),implies(not(y),not(x))))), inference(closure_rule, [i_0_6])).
% 0.14/0.39 cnf(i_0_42, plain, (implies(truth,implies(implies(x,y),implies(not(y),not(x))))!=implies(truth,truth)), inference(etableau_closure_rule, [i_0_42, ...])).
% 0.14/0.39 # End printing tableau
% 0.14/0.39 # SZS output end
% 0.14/0.39 # Branches closed with saturation will be marked with an "s"
% 0.14/0.39 # Child (31324) has found a proof.
% 0.14/0.39
% 0.14/0.39 # Proof search is over...
% 0.14/0.39 # Freeing feature tree
%------------------------------------------------------------------------------