TSTP Solution File: REL008+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : REL008+1 : 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 : n012.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:20:42 EDT 2022
% Result : Theorem 8.58s 1.44s
% Output : CNFRefutation 8.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : REL008+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 12:04:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.12/0.36 # and selection function SelectNewComplexAHP.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 14 Number of unprocessed: 14
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 14 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 14 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 0 extension rule candidate clauses
% 0.12/0.36 # 14 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 23 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 23 tableaux to operate on
% 8.58/1.44 # There were 1 total branch saturation attempts.
% 8.58/1.44 # There were 0 of these attempts blocked.
% 8.58/1.44 # There were 0 deferred branch saturation attempts.
% 8.58/1.44 # There were 0 free duplicated saturations.
% 8.58/1.44 # There were 1 total successful branch saturations.
% 8.58/1.44 # There were 0 successful branch saturations in interreduction.
% 8.58/1.44 # There were 0 successful branch saturations on the branch.
% 8.58/1.44 # There were 1 successful branch saturations after the branch.
% 8.58/1.44 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.58/1.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.58/1.44 # Begin clausification derivation
% 8.58/1.44
% 8.58/1.44 # End clausification derivation
% 8.58/1.44 # Begin listing active clauses obtained from FOF to CNF conversion
% 8.58/1.44 cnf(i_0_8, plain, (converse(converse(X1))=X1)).
% 8.58/1.44 cnf(i_0_6, plain, (composition(X1,one)=X1)).
% 8.58/1.44 cnf(i_0_12, plain, (join(X1,complement(X1))=top)).
% 8.58/1.44 cnf(i_0_13, plain, (meet(X1,complement(X1))=zero)).
% 8.58/1.44 cnf(i_0_9, plain, (join(converse(X1),converse(X2))=converse(join(X1,X2)))).
% 8.58/1.44 cnf(i_0_10, plain, (composition(converse(X1),converse(X2))=converse(composition(X2,X1)))).
% 8.58/1.44 cnf(i_0_4, plain, (complement(join(complement(X1),complement(X2)))=meet(X1,X2))).
% 8.58/1.44 cnf(i_0_2, plain, (join(join(X1,X2),X3)=join(X1,join(X2,X3)))).
% 8.58/1.44 cnf(i_0_5, plain, (composition(composition(X1,X2),X3)=composition(X1,composition(X2,X3)))).
% 8.58/1.44 cnf(i_0_7, plain, (join(composition(X1,X2),composition(X3,X2))=composition(join(X1,X3),X2))).
% 8.58/1.44 cnf(i_0_11, plain, (join(complement(X1),composition(converse(X2),complement(composition(X2,X1))))=complement(X1))).
% 8.58/1.44 cnf(i_0_3, plain, (join(meet(X1,X2),complement(join(complement(X1),X2)))=X1)).
% 8.58/1.44 cnf(i_0_1, plain, (join(X1,X2)=join(X2,X1))).
% 8.58/1.44 cnf(i_0_14, negated_conjecture, (join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))!=composition(esk1_0,join(esk2_0,esk3_0)))).
% 8.58/1.44 cnf(i_0_16, plain, (X32=X32)).
% 8.58/1.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 8.58/1.44 # Begin printing tableau
% 8.58/1.44 # Found 6 steps
% 8.58/1.44 cnf(i_0_8, plain, (converse(converse(X3))=X3), inference(start_rule)).
% 8.58/1.44 cnf(i_0_25, plain, (converse(converse(X3))=X3), inference(extension_rule, [i_0_23])).
% 8.58/1.44 cnf(i_0_57, plain, (converse(converse(X5))!=X5), inference(closure_rule, [i_0_8])).
% 8.58/1.44 cnf(i_0_55, plain, (composition(converse(converse(X3)),converse(converse(X5)))=composition(X3,X5)), inference(extension_rule, [i_0_19])).
% 8.58/1.44 cnf(i_0_66, plain, (composition(X3,X5)!=converse(converse(composition(X3,X5)))), inference(closure_rule, [i_0_8])).
% 8.58/1.44 cnf(i_0_64, plain, (composition(converse(converse(X3)),converse(converse(X5)))=converse(converse(composition(X3,X5)))), inference(etableau_closure_rule, [i_0_64, ...])).
% 8.58/1.44 # End printing tableau
% 8.58/1.44 # SZS output end
% 8.58/1.44 # Branches closed with saturation will be marked with an "s"
% 8.58/1.44 # Child (28228) has found a proof.
% 8.58/1.44
% 8.58/1.44 # Proof search is over...
% 8.58/1.44 # Freeing feature tree
%------------------------------------------------------------------------------