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