%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : RNG083+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 : n024.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 20:27:18 EDT 2022 % Result : Theorem 16.31s 2.49s % Output : CNFRefutation 16.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : RNG083+1 : TPTP v8.1.0. Released v4.0.0. % 0.13/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.35 % Computer : n024.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Mon May 30 22:27:21 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S % 0.14/0.38 # and selection function SelectNewComplexAHPNS. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 21 Number of unprocessed: 21 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 21 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 1 conjectures. % 0.14/0.39 # There are 1 start rule candidates: % 0.14/0.39 # Found 3 unit axioms. % 0.14/0.39 # 1 start rule tableaux created. % 0.14/0.39 # 18 extension rule candidate clauses % 0.14/0.39 # 3 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.14/0.39 # Creating equality axioms % 0.14/0.39 # Ran out of tableaux, making start rules for all clauses % 0.14/0.39 # Returning from population with 51 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 51 tableaux to operate on % 16.31/2.49 # There were 2 total branch saturation attempts. % 16.31/2.49 # There were 0 of these attempts blocked. % 16.31/2.49 # There were 0 deferred branch saturation attempts. % 16.31/2.49 # There were 0 free duplicated saturations. % 16.31/2.49 # There were 2 total successful branch saturations. % 16.31/2.49 # There were 0 successful branch saturations in interreduction. % 16.31/2.49 # There were 0 successful branch saturations on the branch. % 16.31/2.49 # There were 2 successful branch saturations after the branch. % 16.31/2.49 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 16.31/2.49 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 16.31/2.49 # Begin clausification derivation % 16.31/2.49 % 16.31/2.49 # End clausification derivation % 16.31/2.49 # Begin listing active clauses obtained from FOF to CNF conversion % 16.31/2.49 cnf(i_0_2, plain, (aElement0(sz00))). % 16.31/2.49 cnf(i_0_21, hypothesis, (aElement0(xx))). % 16.31/2.49 cnf(i_0_3, plain, (aElement0(sz10))). % 16.31/2.49 cnf(i_0_22, negated_conjecture, (sdtasdt0(sz00,xx)!=sz00|sdtasdt0(xx,sz00)!=sz00)). % 16.31/2.49 cnf(i_0_9, plain, (sdtpldt0(sz00,X1)=X1|~aElement0(X1))). % 16.31/2.49 cnf(i_0_15, plain, (sdtasdt0(sz10,X1)=X1|~aElement0(X1))). % 16.31/2.49 cnf(i_0_10, plain, (sdtpldt0(X1,sz00)=X1|~aElement0(X1))). % 16.31/2.49 cnf(i_0_4, plain, (aElement0(smndt0(X1))|~aElement0(X1))). % 16.31/2.49 cnf(i_0_16, plain, (sdtasdt0(X1,sz10)=X1|~aElement0(X1))). % 16.31/2.49 cnf(i_0_11, plain, (sdtpldt0(smndt0(X1),X1)=sz00|~aElement0(X1))). % 16.31/2.49 cnf(i_0_12, plain, (sdtpldt0(X1,smndt0(X1))=sz00|~aElement0(X1))). % 16.31/2.49 cnf(i_0_6, plain, (aElement0(sdtasdt0(X1,X2))|~aElement0(X2)|~aElement0(X1))). % 16.31/2.49 cnf(i_0_13, plain, (sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aElement0(X2)|~aElement0(X1))). % 16.31/2.49 cnf(i_0_19, plain, (sdtasdt0(X1,smndt0(sz10))=smndt0(X1)|~aElement0(X1))). % 16.31/2.49 cnf(i_0_20, plain, (sdtasdt0(smndt0(sz10),X1)=smndt0(X1)|~aElement0(X1))). % 16.31/2.49 cnf(i_0_5, plain, (aElement0(sdtpldt0(X1,X2))|~aElement0(X2)|~aElement0(X1))). % 16.31/2.49 cnf(i_0_7, plain, (sdtpldt0(X1,X2)=sdtpldt0(X2,X1)|~aElement0(X2)|~aElement0(X1))). % 16.31/2.49 cnf(i_0_8, plain, (sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 16.31/2.49 cnf(i_0_14, plain, (sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 16.31/2.49 cnf(i_0_18, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))=sdtasdt0(X1,sdtpldt0(X2,X3))|~aElement0(X3)|~aElement0(X2)|~aElement0(X1))). % 16.31/2.49 cnf(i_0_17, plain, (sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X3,X2))=sdtasdt0(sdtpldt0(X1,X3),X2)|~aElement0(X2)|~aElement0(X3)|~aElement0(X1))). % 16.31/2.49 cnf(i_0_121, plain, (X26=X26)). % 16.31/2.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 16.31/2.49 # Begin printing tableau % 16.31/2.49 # Found 7 steps % 16.31/2.49 cnf(i_0_2, plain, (aElement0(sz00)), inference(start_rule)). % 16.31/2.49 cnf(i_0_129, plain, (aElement0(sz00)), inference(extension_rule, [i_0_14])). % 16.31/2.49 cnf(i_0_216, plain, (~aElement0(sz00)), inference(closure_rule, [i_0_2])). % 16.31/2.49 cnf(i_0_217, plain, (~aElement0(sz00)), inference(closure_rule, [i_0_2])). % 16.31/2.49 cnf(i_0_215, plain, (sdtasdt0(sdtasdt0(sz00,sz00),sz00)=sdtasdt0(sz00,sdtasdt0(sz00,sz00))), inference(extension_rule, [i_0_125])). % 16.31/2.49 cnf(i_0_534, plain, (aElement0(sdtasdt0(sz00,sdtasdt0(sz00,sz00)))), inference(etableau_closure_rule, [i_0_534, ...])). % 16.31/2.49 cnf(i_0_536, plain, (~aElement0(sdtasdt0(sdtasdt0(sz00,sz00),sz00))), inference(etableau_closure_rule, [i_0_536, ...])). % 16.31/2.49 # End printing tableau % 16.31/2.49 # SZS output end % 16.31/2.49 # Branches closed with saturation will be marked with an "s" % 16.31/2.50 # Child (17867) has found a proof. % 16.31/2.50 % 16.31/2.50 # Proof search is over... % 16.31/2.50 # Freeing feature tree %------------------------------------------------------------------------------