TSTP Solution File: REL026+4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : REL026+4 : TPTP v8.1.0. Released v4.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 : n023.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 : Mon Jul 18 19:21:10 EDT 2022
% Result : Theorem 12.45s 1.96s
% Output : CNFRefutation 12.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : REL026+4 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jul 8 09:56:56 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.39 # No SInE strategy applied
% 0.22/0.39 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.22/0.39 # and selection function SelectNewComplexAHP.
% 0.22/0.39 #
% 0.22/0.39 # Number of axioms: 17 Number of unprocessed: 17
% 0.22/0.39 # Tableaux proof search.
% 0.22/0.39 # APR header successfully linked.
% 0.22/0.39 # Hello from C++
% 0.22/0.39 # The folding up rule is enabled...
% 0.22/0.39 # Local unification is enabled...
% 0.22/0.39 # Any saturation attempts will use folding labels...
% 0.22/0.39 # 17 beginning clauses after preprocessing and clausification
% 0.22/0.39 # Creating start rules for all 2 conjectures.
% 0.22/0.39 # There are 2 start rule candidates:
% 0.22/0.39 # Found 16 unit axioms.
% 0.22/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.22/0.39 # 2 start rule tableaux created.
% 0.22/0.39 # 1 extension rule candidate clauses
% 0.22/0.39 # 16 unit axiom clauses
% 0.22/0.39
% 0.22/0.39 # Requested 8, 32 cores available to the main process.
% 0.22/0.39 # There are not enough tableaux to fork, creating more from the initial 2
% 0.22/0.39 # Creating equality axioms
% 0.22/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.22/0.39 # Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
% 0.22/0.39 # We now have 24 tableaux to operate on
% 12.45/1.96 # There were 1 total branch saturation attempts.
% 12.45/1.96 # There were 0 of these attempts blocked.
% 12.45/1.96 # There were 0 deferred branch saturation attempts.
% 12.45/1.96 # There were 0 free duplicated saturations.
% 12.45/1.96 # There were 1 total successful branch saturations.
% 12.45/1.96 # There were 0 successful branch saturations in interreduction.
% 12.45/1.96 # There were 0 successful branch saturations on the branch.
% 12.45/1.96 # There were 1 successful branch saturations after the branch.
% 12.45/1.96 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.45/1.96 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.45/1.96 # Begin clausification derivation
% 12.45/1.96
% 12.45/1.96 # End clausification derivation
% 12.45/1.96 # Begin listing active clauses obtained from FOF to CNF conversion
% 12.45/1.96 cnf(i_0_8, plain, (converse(converse(X1))=X1)).
% 12.45/1.96 cnf(i_0_18, negated_conjecture, (join(esk1_0,one)=one)).
% 12.45/1.96 cnf(i_0_6, plain, (composition(X1,one)=X1)).
% 12.45/1.96 cnf(i_0_12, plain, (join(X1,complement(X1))=top)).
% 12.45/1.96 cnf(i_0_1, plain, (join(X1,X2)=join(X2,X1))).
% 12.45/1.96 cnf(i_0_9, plain, (converse(join(X1,X2))=join(converse(X1),converse(X2)))).
% 12.45/1.96 cnf(i_0_10, plain, (converse(composition(X1,X2))=composition(converse(X2),converse(X1)))).
% 12.45/1.96 cnf(i_0_13, plain, (complement(join(complement(X1),complement(complement(X1))))=zero)).
% 12.45/1.96 cnf(i_0_2, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 12.45/1.96 cnf(i_0_5, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
% 12.45/1.96 cnf(i_0_7, plain, (join(composition(X1,X3),composition(X2,X3))=composition(join(X1,X2),X3))).
% 12.45/1.96 cnf(i_0_11, plain, (join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2))).
% 12.45/1.96 cnf(i_0_3, plain, (join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))=X1)).
% 12.45/1.96 cnf(i_0_17, negated_conjecture, (join(complement(join(complement(composition(esk1_0,top)),complement(esk2_0))),composition(esk1_0,esk2_0))!=composition(esk1_0,esk2_0)|join(composition(esk1_0,esk2_0),complement(join(complement(composition(esk1_0,top)),complement(esk2_0))))!=complement(join(complement(composition(esk1_0,top)),complement(esk2_0))))).
% 12.45/1.96 cnf(i_0_14, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))=composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))))).
% 12.45/1.96 cnf(i_0_15, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))))=complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))))).
% 12.45/1.96 cnf(i_0_16, plain, (join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)),complement(X3))))=complement(join(complement(composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),X2)),complement(X3))))).
% 12.45/1.96 cnf(i_0_28, plain, (X40=X40)).
% 12.45/1.96 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 12.45/1.96 # Begin printing tableau
% 12.45/1.96 # Found 6 steps
% 12.45/1.96 cnf(i_0_18, negated_conjecture, (join(esk1_0,one)=one), inference(start_rule)).
% 12.45/1.96 cnf(i_0_37, plain, (join(esk1_0,one)=one), inference(extension_rule, [i_0_31])).
% 12.45/1.96 cnf(i_0_82, plain, (converse(converse(one))!=one), inference(closure_rule, [i_0_8])).
% 12.45/1.96 cnf(i_0_80, plain, (join(esk1_0,one)=converse(converse(one))), inference(extension_rule, [i_0_32])).
% 12.45/1.96 cnf(i_0_91, plain, (converse(converse(X4))!=X4), inference(closure_rule, [i_0_8])).
% 12.45/1.96 cnf(i_0_89, plain, (join(join(esk1_0,one),converse(converse(X4)))=join(converse(converse(one)),X4)), inference(etableau_closure_rule, [i_0_89, ...])).
% 12.45/1.96 # End printing tableau
% 12.45/1.96 # SZS output end
% 12.45/1.96 # Branches closed with saturation will be marked with an "s"
% 12.45/1.97 # Child (14037) has found a proof.
% 12.45/1.97
% 12.45/1.97 # Proof search is over...
% 12.45/1.97 # Freeing feature tree
%------------------------------------------------------------------------------